429069

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, 0, 0), (0, -1, 1), (0, 1, 0), (1, 1, 0)}.at n=10A150340
• T(n,k) = Number of length n+5 0..k arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four.at n=37A249085
• Number of length 2+5 0..n arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four.at n=7A249087