450812
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, 0, 1), (-1, 1, 1), (0, 1, 1), (1, 0, -1)}.at n=12A148455
- Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 7.at n=8A200467
- G.f. A(x) satisfies: A(x) = 1 - Sum_{k=1..3} (x * A(x))^k.at n=22A337512