40349

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=9A149038
• Number of standard Young tableaux with n cells such that the lengths of the first and the last row differ by 4.at n=6A244298
• Number of length-(n+1) 0..2 arrays with new repeated values introduced in sequential order starting with zero.at n=9A268255
• a(n) is the sum of the lengths of all the segments used to draw a rectangle of height partition(n) and width n divided into partition(n) rectangles of unit height, in turn, divided into rectangles of unit height and lengths corresponding to the parts of the partitions of n.at n=22A338969