146160

Appears in sequences

• 4-dimensional figurate numbers: a(n) = (6*n-2)*binomial(n+2,3)/4.at n=26A002419
• a(n) = (4*n + 1)*n!.at n=7A082034
• a(n) = L(n) * n! where L(n) are the Lucas numbers.at n=7A100404
• Triangle where T(n,k) = n!*[x^k] ( x/(2*x + log(1-x)) )^(n+1), for n>=k>=0, read by rows.at n=31A118787
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns starting at level 0 (n >= 1; 0 <= k <= n-1).at n=36A121634
• Number of deco polyominoes of height n, having no 2-cell columns starting at level 0. 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=8A121635
• a(n) = n! * A000110(n) where A000110 is the sequence of Bell numbers.at n=6A137341
• Number of 15 X 15 arrays of squares of integers, symmetric about the diagonal and under 90-degree rotation, with all rows summing to n.at n=8A156419
• Triangle T(n,k) for solving differential equation A'(x)=G(A(x)), G(0)!=0.at n=46A190015
• Numbers with prime factorization pqrs^2t^4.at n=13A190384
• Lower triangular matrix in the LU-decomposition of the Vandermonde determinants generated by Fibonacci numbers.at n=25A210574
• Triangle read by rows: coefficients of second-order hypergeometric-harmonic polynomials.at n=33A222061
• Number of ordered pairs of permutation functions on n elements where f(f(f(x))) = g(g(g(x))).at n=7A239838
• Number T(n,k) of partitions of n into parts of exactly k sorts; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=43A255970
• a(n) = n*(n+1)*(n+2)*(n^2+2*n+17)/120.at n=26A257199
• Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n things that require k stack-sorts.at n=53A262494
• Numbers between a pair of consecutive highly abundant numbers (A002093) having the same sum of divisors as the lesser one.at n=3A308574
• a(n) is the smallest number m with exactly n such divisors d that sigma(d) divides m.at n=36A309253
• Number T(n,k) of colored set partitions of [n] where exactly k colors are used for the elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=27A323099
• Number T(n,k) of colored set partitions of [n] where elements of subsets have distinct colors and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=27A323128