364051

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, 0), (-1, 1, -1), (0, 1, 1), (1, -1, -1)}.at n=13A148216
• Number of nX8 -1,1 arrays such that the sum over i=1..n,j=1..8 of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 8-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship).at n=8A225344
• Number of 9Xn -1,1 arrays such that the sum over i=1..9,j=1..n of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute n-across galley oarsmen left-right at 9 fore-aft positions so that there are no turning moments on the ship).at n=7A225349