A225341 Number of nX5 -1,1 arrays such that the sum over i=1..n,j=1..5 of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 5-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship).
0, 0, 0, 12, 0, 0, 0, 4508, 0, 0, 0, 2680534, 0, 0, 0, 1985837462, 0, 0, 0, 1663045511892, 0, 0, 0, 1506336601246000, 0, 0, 0, 1440828827246863370, 0, 0, 0, 1434551060282150636452, 0, 0, 0, 1472882578482323918604276, 0, 0, 0
Offset: 1
Keywords
Examples
Some solutions for n=4 .-1.-1.-1.-1..1...-1.-1.-1.-1.-1....1..1..1..1..1...-1.-1.-1..1..1 .-1..1..1..1..1....1..1..1..1..1...-1.-1.-1.-1.-1...-1..1..1..1..1 .-1..1..1..1..1....1..1..1..1..1...-1.-1.-1.-1.-1...-1.-1.-1.-1..1 .-1.-1.-1.-1..1...-1.-1.-1.-1.-1....1..1..1..1..1...-1.-1..1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..123
Comments