172019
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, 0), (-1, 1, 0), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=10A149035
- Number of partitions of n the largest part of which, call it m, appears once, m-1 appears at most twice, m-2 appears at most thrice, etc.at n=51A244393