32120

Appears in sequences

• Second-order Eulerian numbers <<n,3>>.at n=4A006260
• Second-order Eulerian triangle T(n,k), 1 <= k <= n.at n=24A008517
• Coordination sequence for 4-dimensional I-centered cubic orthogonal lattice.at n=20A008532
• Every run of digits of n in base 3 has length 2.at n=39A033001
• Numbers n such that the Diophantine equation x^4+y^5=n^4 has solutions.at n=39A070756
• Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals.at n=24A112007
• Fourth diagonal of second-order Eulerian triangle A008517. Fourth column (m=3) of triangle A112007.at n=3A112008
• Triangle related to the o.g.f.s. of the right-hand columns of A130534 (E(x,m=1,n)).at n=31A163936
• Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.at n=31A201637
• Number of (n+2) X 7 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=8A202444
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 286", based on the 5-celled von Neumann neighborhood.at n=28A287480
• Row reversed version of triangle A201637 (second-order Eulerian triangle).at n=32A288874
• Expansion of Product_{k>=1} 1 / (1 - Fibonacci(k)*x^k).at n=17A300520
• Polydivisible nonnegative integers whose decimal digits span an initial interval of {0,...,9}.at n=12A305712
• G.f. A(x) satisfies: Sum_{n>=0} (-1)^n * Product_{k=1..n} x^(n+1-k) + (-A(x))^k = 1.at n=13A306089
• Number of generalized Young tableaux with constant rows, weakly increasing columns, and entries summing to n.at n=24A323582
• E2(n, k), the second-order Eulerian numbers with E2(0, k) = δ_{0, k}. Triangle read by rows, E2(n, k) for 0 <= k <= n.at n=32A340556