31120

Appears in sequences

• Cubic star numbers: a(n) = n^3 + 4*Sum_{i=0..n-1} i^2.at n=24A051673
• Triangle, read by rows, where diagonal m of T equals diagonal m-1 of matrix power T^m for m>1: T(n,k) = [T^(n-k)](n-1,k) for n>=k>0, with T(n,n)=1 and T(n+1,n)=n+1 for n>=0.at n=39A132471
• Numbers k such that k^k = k (mod prime(k)).at n=9A177005
• Positions of pandigital 10-digit numbers after the decimal point in the decimal expansion of Pi.at n=16A280183
• "Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t".at n=35A284515
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2*b(n-1) - b(n-2) - 2, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=18A294426
• Triangle read by rows: T(n,k) is the number of permutations pi of [n] such that pi has k+1 valleys and s(pi) avoids the patterns 132 and 321, where s is West's stack-sorting map (0 <= k <= floor((n-1)/2)).at n=34A319030
• Sum of the eighth largest parts in the partitions of n into 9 parts.at n=51A326466
• a(n) = n * (binomial(n,2) - 2).at n=40A341768
• Number of integer partitions of n having a part that can be written as a nonnegative linear combination of the other (possibly equal) parts.at n=39A364913
• a(n) is the number of multisets of n decimal digits where the sum of the digits equals the product of the prime digits.at n=28A384445