31572

Appears in sequences

• Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.at n=43A000931
• a(0) = 0, a(1) = a(2) = a(3) = 1; thereafter, a(n) = a(n-1) + a(n-2) + a(n-4).at n=21A005251
• Pisot sequences E(4,7), P(4,7).at n=16A010901
• Pisot sequences E(3,7), P(3,7).at n=11A010912
• a(0) = 0, a(1) = 1, a(2) = 1; thereafter a(n) = 5*a(n-1) - 4*a(n-2) + a(n-3).at n=11A012855
• Pisot sequences E(7,9), P(7,9).at n=30A020720
• Triangle read by rows: T(n,c) = number of successive equalities in set partitions of n.at n=47A056857
• Triangle T(n,k) = number of element-subset partitions of {1..n} with n-k+1 equalities (n >= 1, 1 <= k <= n).at n=52A056860
• Numbers k such that 2^k - 17 is prime.at n=39A059611
• Expansion of (1 - x)/(1 - x^2 - x^3).at n=45A078027
• a(n) = n * prime(prime(n)).at n=35A080697
• a(n+3) = 3*a(n+2) - 2*a(n+1) + a(n).at n=12A095263
• Number of n-th generation triangles in the tiling of the hyperbolic plane by triangles with angles {Pi/2, Pi/3, 0}.at n=33A096231
• Quadrisection of a Padovan sequence.at n=10A099098
• Numbers n such that 3*10^n+7 is prime.at n=15A100501
• a(n) = C(n,2)*Bell(n-2) (cf. A000217, A000110).at n=9A105479
• Padovan sequence for indices of the Beatty sequence of the tribonacci constant.at n=21A108168
• a(n)=the sum of the (1,2)- and (1,3)-entries of the matrix P^n + T^n, where the 3 X 3 matrices P and T are defined by P=[0,1,0;0,0,1;1,0,0] and T=[0,1,0;0,0,1;1,1,0].at n=39A109524
• Padovan numbers for which the digital root is also a Padovan number.at n=31A117598
• Padovan numbers for which the multiplicative digital root is also a Padovan number.at n=27A117600