35902

Appears in sequences

• Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).at n=44A001522
• a(n) = 15 + floor((2 + Sum_{j=1..n-1} a(j))/3).at n=27A120159
• 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), (0, 0, -1), (0, 0, 1), (0, 1, -1), (1, 0, -1)}.at n=10A149076