24760

Appears in sequences

• dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5).at n=42A026063
• a(n) = (117*n^2 - 99*n + 2)/2.at n=21A050408
• G.f. satisfies: A(x) = exp( Sum_{n>=1} L(n)*A(x^n)*x^n/n ) where L(n) = n-th Lucas number.at n=11A073063
• Numbers k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes.at n=15A178084
• Square array read by antidiagonals. Convolution of a(n) = 2*a(n-1) - a(n-2) and 10^n.at n=41A178643
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with at least 3 alternating runs (it is assumed that the smallest element of a cycle is in the first position), 0<=k<=floor(n/4).at n=13A187250
• Number of nondecreasing sequences of n 1..6 integers with no element dividing the sequence sum.at n=34A212866
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 2*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 + 2*x^2.at n=50A368157
• The number of possible values that can be obtained for the Shannon diversity index across all partitions of n.at n=44A383683