63121

Appears in sequences

• Number of nX6 -1,1 arrays such that the sum over i=1..n,j=1..6 of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 6-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship).at n=8A225342
• 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=5A225349
• Numbers k that can be written as the sum of a perfect square and a factorial in exactly 3 distinct ways.at n=2A359013