408240

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*9^j.at n=31A038215
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*2^j.at n=32A038292
• Denominators of coefficients in function a(x) such that a(a(a(x))) = sin x.at n=3A052135
• Expansion of e.g.f. x^3/(1-3*x).at n=7A052678
• a(n) = n! + (n-1)! + (n-2)!.at n=9A054119
• Number of ways of expressing an n-cycle in the symmetric group S_n as a product of n+1 transpositions.at n=5A060603
• a(1) = 3, a(n) = smallest multiple of a(n-1) such that 10*a(n) + 1 is prime.at n=11A089325
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n with k cells in the first column. (A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column).at n=47A100822
• Partial sum of A005915.at n=26A126274
• Triangle read by rows: T(n, k) = (n+1)!*(1/k + 1/(n-k+1)).at n=28A156047
• Triangle read by rows: T(n, k) = (n+1)!*(1/k + 1/(n-k+1)).at n=35A156047
• Sequence obtained from Fibonacci numbers by taking the factorials of each digit and summing.at n=16A164955
• a(1) = 1, for n > 1: a(n) = phi(sum of the previous terms) where phi is Euler's totient function.at n=28A165931
• Triangle T(n, k) = n!*q^k/(n-k)! if floor(n/2) > k-1 otherwise n!*q^(n-k)/k!, with q = 3, read by rows.at n=59A174377
• Triangle T(n, k) = n!*q^k/(n-k)! if floor(n/2) > k-1 otherwise n!*q^(n-k)/k!, with q = 3, read by rows.at n=61A174377
• Triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes such that the root node has degree k. n>=2, 1<=k<=n-1.at n=41A206429
• Array read by antidiagonals: T(m,n) = Sum( n <= i <= m+n-1 ) i!.at n=38A211370
• Numbers that divide the product of the nonzero digits (in base 10) of their square.at n=42A218013
• Record high values in A222208.at n=43A242297
• Number of endofunctions on [n] where the largest cycle length equals 8.at n=1A246218