109606

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), (1, 0, 0), (1, 1, -1)}.at n=10A148764
• Number of ways to fill a Young diagram with positive integers summing to n such that all rows and columns are weakly increasing.at n=19A323450