1411200

Appears in sequences

• a(n) = binomial(n,floor(n/2))*(n+1)!.at n=7A002867
• Expansion of e.g.f. (2-2*x-x^2)/((1-x)*(1-x-x^2)).at n=8A052660
• Bishops on an 8n+1 X 8n+1 board (see Robinson paper for details).at n=4A123072
• Smallest number m having exactly n divisors d with sqrt(m/2) <= d < sqrt(2*m).at n=21A128605
• A new q-combination type general triangle sequence based on Stirling first polynomials: here q=4: m=3: t(n,k)=If[m == 0, n!, Product[Sum[(-1)^(i + k)*StirlingS1[k - 1, i]*(m + 1)^i, {i, 0, k - 1}], {k, 1, n}]]; b(n,k,m)=If[n == 0, 1, t[n, m]/(t[k, m]*t[n - k, m])].at n=23A156586
• A new q-combination type general triangle sequence based on Stirling first polynomials: here q=4: m=3: t(n,k)=If[m == 0, n!, Product[Sum[(-1)^(i + k)*StirlingS1[k - 1, i]*(m + 1)^i, {i, 0, k - 1}], {k, 1, n}]]; b(n,k,m)=If[n == 0, 1, t[n, m]/(t[k, m]*t[n - k, m])].at n=25A156586
• Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.at n=31A156992
• Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.at n=32A156992
• Triangle T(n, k) = (-1)^n*(k+1)!*(n-k+1)!*binomial(n+2, k+2)*binomial(n+2, n-k+2) read by rows.at n=23A176861
• Triangle T(n, k) = (-1)^n*(k+1)!*(n-k+1)!*binomial(n+2, k+2)*binomial(n+2, n-k+2) read by rows.at n=25A176861
• a(n) = A002952(n) + A002953(n).at n=16A180277
• Number of ways to arrange n books on 4 consecutive bookshelves, leaving no shelf empty.at n=4A200979
• Product of the digits of the n-th Fibonacci number.at n=56A246558
• Triangle read by rows: T(n,k) are the coefficients of the Lagrange (compositional) inversion of a function in terms of the Taylor series expansion of its reciprocal, n >= 1, k = 1..A000041(n-1).at n=47A248927
• a(n) = ((1+n)*floor(1+n/2))*(n!/floor(1+n/2)!)^2.at n=7A329965
• a(n) = lcm([ n!*binomial(n-1, m-1) / m! for m = 1..n ]) with a(0) = 1.at n=8A359365
• Triangle read by rows, T(n, k) = RisingFactorial(n - k, k) * FallingFactorial(n, k).at n=40A362588
• Numbers whose cubes have more square divisors than the cube of any smaller number.at n=26A377141
• The second Jordan totient function applied to the squares.at n=34A379833
• a(n) is the least exponential deficient number that has exactly n exponential abundant divisors.at n=14A389300