212941

Appears in sequences

• Central trinomial coefficients: largest coefficient of (1 + x + x^2)^n.at n=13A002426
• Number of symmetric, reduced unit interval schemes with n+1 intervals (n>=1).at n=26A005213
• 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=49A132885
• Number of n X 13 0..2 arrays with row sums 13 and column sums n.at n=1A172643
• Number of n X 13 0..3 arrays with row sums 13 and column sums n.at n=1A172746
• a(n) = Sum_{k=0..n} binomial(2*k, k) * binomial(2*n+1, 2*k).at n=6A273055
• Irregular triangle read by rows: T(n,m) = number of lattice paths of type A^H terminating at point (n, m).at n=42A291081
• 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=34A337369