47600

Appears in sequences

• Rounded value of n*L_n(-1) where L is the Laguerre polynomial.at n=25A070070
• Expansion of e.g.f. exp(x^3/3!)/(1-x).at n=8A130906
• Number of sequences {c(i), i=0..n} that form the initial terms of a self-convolution 4th power of an integer sequence such that 0 < c(n) <= 4*c(n-1) for n>0 with c(0)=1.at n=5A132854
• Difference between the cubes and 2*tetrahedral numbers; A000578(n) - 2*A000292(n).at n=42A146298
• A partition product of Stirling_2 type [parameter k = 2] with biggest-part statistic (triangle read by rows).at n=24A157402
• A(n,k,m) is the number of permutations of an n-set with k disjoint cycles of length less than or equal to m, called the (n,k)-th m-restrained Stirling numbers of the first kind, and denoted by mS_1(n,k). The sequence shows the case of m=3.at n=48A171996
• Triangular array read by rows: T(n,k) is the number of endofunctions f:{1,2,...,n}-> {1,2,...,n} whose largest component has exactly k nodes; n>=1, 1<=k<=n.at n=23A209324
• Expansion of g.f. 1/2 + 1/(1+sqrt(1-8*x+8*x^2)).at n=8A226316
• a(n) = n*(n+1)*(7*n+2)/6.at n=34A255211
• E.g.f. C(x,y) = 1 + Integral S(x,y)*C(y,x) dx such that C(x,y)^2 - S(x,y)^2 = 1 and C(y,x) = Integral S(y,x)*C(x,y) dy, where C(x,y) = Sum_{n>=0} Sum_{k=0..n} T(n,k) * x^(2*n-2*k)*y^(2*k)/((2*n-2*k)!*(2*k)!), as a triangle of coefficients T(n,k) read by rows.at n=23A322221
• E.g.f. C(y,x) = 1 + Integral S(y,x)*C(x,y) dy such that C(y,x)^2 - S(y,x)^2 = 1 and C(x,y) = Integral S(x,y)*C(y,x) dx, where C(y,x) = Sum_{n>=0} Sum_{k=0..n} T(n,k) * x^(2*n-2*k)*y^(2*k)/((2*n-2*k)!*(2*k)!), as a triangle of coefficients T(n,k) read by rows.at n=25A322222
• Numbers that are the sum of four third powers in eight or more ways.at n=23A345152
• Numbers that are the sum of four third powers in exactly eight ways.at n=18A345153
• E.g.f. C(x,y) = 1 - Integral S(x,y)*C(y,x) dx such that C(x,y)^2 + S(x,y)^2 = 1 and S(y,x) = Integral C(y,x)*C(x,y) dy, as a triangle of coefficients T(n,k) read by rows.at n=23A367381
• 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 + 3*x^2.at n=51A368518