98409

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, 0, -1), (-1, 0, 1), (1, -1, 0), (1, 1, 0)}.at n=10A149137
• Number of ways to split an integer partition of n into contiguous subsequences with strictly increasing sums.at n=37A336134