25653

Appears in sequences

• Central trinomial coefficients: largest coefficient of (1 + x + x^2)^n.at n=11A002426
• Number of symmetric, reduced unit interval schemes with n+1 intervals (n>=1).at n=22A005213
• Triangle read by rows: T(n,k) is the number of ternary words of length n on {0,1,2} having k drops (n>=0, k>=0). The drops of a ternary word on {0,1,2} are the subwords 10,20 and 21.at n=40A120906
• Triangle read by rows: T(n,k) is the number of ternary words of length n with k strictly increasing runs (0 <= k <= n; for example, the ternary word 2|01|12|02|1|1|012|2 has 8 strictly increasing runs).at n=62A120987
• Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H=(2,0) steps (0 <= k <= floor(n/2)).at n=36A132885
• Number of n X 11 0..2 arrays with row sums 11 and column sums n.at n=1A172644
• Number of n X 11 0..3 arrays with row sums 11 and column sums n.at n=1A172747
• Number of n X 11 0..4 arrays with row sums 11 and column sums n.at n=1A172818
• Number of n X 11 0..5 arrays with row sums 11 and column sums n.at n=1A172869
• Number of n X 11 0..6 arrays with row sums 11 and column sums n.at n=1A172902
• Number of n X 11 0..7 arrays with row sums 11 and column sums n.at n=1A172926
• Number of n X 11 0..8 arrays with row sums 11 and column sums n.at n=1A172946
• a(n) = n*(4*n^2 - 3*n + 5)/6.at n=33A174723
• Number of partitions of n containing a clique of size 7.at n=45A183564
• a(n) = Sum_{k=0..n} binomial(2*k, k) * binomial(2*n+1, 2*k).at n=5A273055
• Number of n X 1 0..2 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes.at n=9A278365
• G.f.: Product_{k>=1} (1+x^(k^2)) / (1-x^k).at n=32A280204
• Irregular triangle read by rows: T(n,m) = number of lattice paths of type A^H terminating at point (n, m).at n=30A291081
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of sqrt(2 / ( (1-2*(k+4)*x+((k-4)*x)^2) * (1+(k-4)*x+sqrt(1-2*(k+4)*x+((k-4)*x)^2)) )).at n=26A337369
• Number of partitions of n with at least three parts larger than 1.at n=38A362548