157184

Appears in sequences

• a(n) = 2 * Sum_{k=0..n-1} binomial(n-1, k)*binomial(n+k, k).at n=8A002003
• Coordination sequence for 8-dimensional cubic lattice.at n=8A008416
• Coordination sequence for C_8 lattice.at n=4A019564
• Number of points of L1 norm 8 in cubic lattice Z^n.at n=8A035602
• Convolution of A055853 with A011782.at n=9A055854
• Number of symmetric Schroeder paths of length 2n (A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis).at n=15A110110
• Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n that start with exactly k (0,1) steps (or, equivalently, with exactly k (1,0) steps).at n=36A110171
• Row sums of A123160.at n=8A123164
• a(n) = 2*a(n-2) + 4*a(n-3), with initial terms 0, 1, 1.at n=19A134136
• Number of (n+1) X (3+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock.at n=16A235949
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) is the coefficient of x^(k*n) in expansion of ( (1 + x)/(1 - x) )^n.at n=53A336521
• Square array read by ascending antidiagonals: T(n,k) = [x^(n*k)] ((1 + x)/(1 - x))^k for n, k >= 1.at n=35A363418