21076

Appears in sequences

• Central factorial numbers: second right-hand column of triangle A008955.at n=5A001819
• Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.at n=19A008955
• Triangle of "Harmonic Coefficients" T(n,k), read by rows: (Sum_{i=1..n} T(n,i) * k^i) * k! / ((n+k)! * n!) = (Sum_{i=1..k} (1/i-1/(i+n)) = n * (Sum_{i=1..k} 1/(i*(i+n)))).at n=10A027858
• Number of irreducible polynomials (over the rationals) of form a*x^2+b*x+c, 1 <= a,b,c <= n.at n=27A079671
• Number of lines through at least 2 points of an 8 X n grid of points.at n=38A160848
• Triangle read by rows: matrix inverse of the central factorial numbers T(2*n, 2*k) (A036969).at n=16A204579
• Number of partitions of n containing at least one part m-6 if m is the largest part.at n=37A212546
• The smallest n-digit number whose first k digits are divisible by the k-th prime for k = 1..n.at n=4A225614
• Denominators of continued fraction transform of e.at n=9A229596
• Number of (n+3)X(2+3) 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=5A230702
• Number of (n+3)X(6+3) 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=1A230706
• T(n,k)=Number of (n+3)X(k+3) 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=22A230708
• T(n,k)=Number of (n+3)X(k+3) 0..2 white square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=26A230708
• Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.at n=23A269944
• Numbers n such that Bernoulli number B_{n} has denominator 690.at n=36A272186
• Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) = (n!)^k * Sum_{i=1..n} 1/i^k.at n=33A291556
• Number of partitions of n with rank congruent to 1 mod 3.at n=42A328989
• a(n) = Sum_{1 <= i < j < k < m <= n} (m*k*j*i)^2.at n=5A354021
• Irregular triangle read by rows: T(n,k) is the total number of parts in all partitions with k designated summands of all positive integers <= n, with n >= 1, 1 <= k <= A003056(n).at n=51A389679