47847
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, 0, 1), (1, 1, -1)}.at n=8A150535
- Number of nX2 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.at n=16A303677
- a(n) = sum for all integer partitions of n of the number of distinct multiplicities in each partition.at n=35A373271