Padovan sequence
sequence of integers
Press Enter · cited answer in seconds
0 sources
Padovan sequence
Summary
Padovan sequence is an integer sequence[1]. It ranks in the top 10% of integer_sequence entities by monthly Wikipedia readership (78 views/month).[2]
Key Facts
- Padovan sequence's instance of is recorded as integer sequence[3].
- Richard Padovan is named after Padovan sequence[4].
- Padovan sequence's Freebase ID is recorded as /m/06rdpv[5].
- Padovan sequence's OEIS ID is recorded as A000931[6].
- Padovan sequence's defining formula is recorded as \begin{align} P_n = P_{n-2} + P_{n-3},!\ \ P_0=P_1=P_2=1\end{align}[7].
- Padovan sequence's defining formula is recorded as f(x)= \frac{1+x}{1-x^2-x^3}[8].
- Padovan sequence's MathWorld ID is recorded as PadovanSequence[9].
- Padovan sequence's maintained by WikiProject is recorded as WikiProject Mathematics[10].
- Padovan sequence's Microsoft Academic ID is recorded as 206359387[11].
Why It Matters
Padovan sequence ranks in the top 10% of integer_sequence entities by monthly Wikipedia readership (78 views/month).[2] It has Wikipedia articles in 11 language editions, a strong signal of global cultural recognition.[12] It is known by 3 alternative names across languages and contexts.[13]