2540160
domain: N
Appears in sequences
- Unary-binary rooted trees with n nodes.at n=9A029766
- Triangle read by rows: T(n,k) = n!*k.at n=42A051683
- E.g.f. x^3/(1-x)^2.at n=9A052571
- Expansion of e.g.f. (1-x^4)/(1-x-x^4).at n=9A052692
- Expansion of e.g.f.: (log(1-x))^2*x^3.at n=10A052766
- a(n) = 7 * n!.at n=8A062098
- Denominators of Blandin-Diaz compositional Bernoulli numbers (B^S)_1,n.at n=6A133003
- A triangular sequence based on expansion of the rational polynomial of A023054 as a Sheffer sequence: p(x,t)=Exp[x*t]*(1 - t^5)/((1 - t)*(1 - t^2)^2*(1 - t^3)).at n=47A138186
- Triangle read by rows: T(n,k) = (n + 1)*(n + k)!.at n=24A143085
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} in which k is an excedance (n >= 2, 1 <= k <= n-1). An excedance of a permutation p is a value j such that p(j) > j.at n=38A152883
- A partition product of Stirling_1 type [parameter k = -5] with biggest-part statistic (triangle read by rows).at n=33A157385
- Triangle T(n, k) = c(n)/(c(k)*c(n-k)) where c(n) = (n-2)!*(n-1)!*n!*(n+1)!/12 with c(0) = c(1) = 1 and c(2) = 2, read by rows.at n=38A173889
- Triangle T(n, k) = c(n)/(c(k)*c(n-k)) where c(n) = (n-2)!*(n-1)!*n!*(n+1)!/12 with c(0) = c(1) = 1 and c(2) = 2, read by rows.at n=42A173889
- Number of closed paths of length n whose steps are 14th roots of unity, U_14(n).at n=9A198806
- (n-1)-st elementary symmetric function of {1,1,2,2,3,3,4,4,5,5,...,Floor[(n+1)/2]}.at n=11A203151
- G.f.: Sum_{n>=0} (n+2)^n * x^n / (1 + (n+2)*x)^n.at n=9A229039
- Number of cyclic arrangements of S={1,2,...,n} such that the difference of any two neighbors is not coprime to their sum.at n=14A242534
- Triangle read by rows, T(n,k) = Sum_{j=0..k-1} S(n,j+1)*S(n,k-j) where S denotes the Stirling cycle numbers A132393, T(0,0)=1, n>=0, 0<=k<=2n-1.at n=45A254882
- Square array A(row,col) read by antidiagonals: A(1,col) = A256450(col-1), and for row > 1, A(row,col) = A255411(A(row-1,col)); Dispersion of factorial base shift A255411 (array transposed).at n=61A257503
- Square array A(row,col): A(row,1) = A256450(row-1), and for col > 1, A(row,col) = A255411(A(row,col-1)); Dispersion of factorial base shift A255411.at n=59A257505