58140

Appears in sequences

• Eulerian numbers of the second kind: <<n+3, n>>.at n=4A002539
• Number of nonequivalent dissections of a polygon into n pentagons by nonintersecting diagonals up to rotation and reflection.at n=8A005040
• Maximal Eulerian numbers of second kind.at n=7A007347
• Second-order Eulerian triangle T(n,k), 1 <= k <= n.at n=25A008517
• a(n) = n*(n + 1)*(n + 2)*(n + 3)/2.at n=17A033486
• G.f.: 1/((1-x)*(1-x^2))^3.at n=31A038163
• Erroneous version of A002539.at n=4A047868
• Expansion of (3+x)/(1-x)^6.at n=15A059599
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having abscissa of the first peak equal to k.at n=44A108438
• Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals.at n=23A112007
• a(n) = C(1+n,1) * C(2+n,1) * C(4+n,2).at n=16A112415
• 2n^4+6n^2+4 = 2(n^2+1)(n^2+2).at n=12A120571
• Triangle related to the o.g.f.s. of the right-hand columns of A130534 (E(x,m=1,n)).at n=30A163936
• a(n) = n*binomial(n+4, 4).at n=15A174002
• Triangle T(n, k) = ((n-k)/6)*binomial(n-1, k-1)*binomial(2*n, 2*k) with T(n, 0) = T(n, n) = 1, read by rows.at n=57A174119
• Triangle T(n, k) = ((n-k)/6)*binomial(n-1, k-1)*binomial(2*n, 2*k) with T(n, 0) = T(n, n) = 1, read by rows.at n=63A174119
• Number of n X 3 arrays with every diagonal and antidiagonal of length L containing a permutation of 1..L.at n=16A179808
• Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.at n=32A201637
• Numbers n such that the sum of the distinct prime divisors of n that are congruent to 1 mod 4 equals the sum of the distinct prime divisors congruent to 3 mod 4.at n=36A215949
• Number of (n - 6)-dissections of an n-gon (equivalently, the number of three-dimensional faces of the (n-3)-dimensional associahedron) modulo the cyclic action.at n=7A220882