157438
domain: N
Appears in sequences
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=10A150069
- Binomial sums: a(n) = Sum_{k=0..floor(n/3)} binomial(n-k,2*k)^2.at n=13A191349
- Number of nX2 0..2 arrays with no more than floor(nX2/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=12A222365
- a(n) = Sum_{k=0..2*n/3} C(n-k,2*k-n)^2.at n=26A298567