33404
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, 0), (0, 1, -1), (1, -1, 0), (1, 1, 0)}.at n=9A149204
- E.g.f. A(x) satisfies: A(x/(1-x))/(1-x) = d/dx x*A(x).at n=6A193161
- Number of length-n 0..3 arrays with no repeated value unequal to the previous repeated value plus one mod 3+1.at n=7A268939
- T(n,k)=Number of length-n 0..k arrays with no repeated value unequal to the previous repeated value plus one mod k+1.at n=52A268944