324753
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, 0), (0, 0, -1), (1, 0, 0)}.at n=12A148585
- Number T(n,k) of partitions of [n] having exactly k blocks of size at least three; triangle T(n,k), n>=0, 0<=k<=floor(n/3), read by rows.at n=28A355144