|
%I #4 May 05 2013 14:37:41
%S 0,0,0,12,0,0,0,4508,0,0,0,2680534,0,0,0,1985837462,0,0,0,
%T 1663045511892,0,0,0,1506336601246000,0,0,0,1440828827246863370,0,0,0,
%U 1434551060282150636452,0,0,0,1472882578482323918604276,0,0,0
%N 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)
%C Column 5 of A225345
%H R. H. Hardin, <a href="/A225341/b225341.txt">Table of n, a(n) for n = 1..123</a>
%e Some solutions for n=4
%e .-1.-1.-1.-1..1...-1.-1.-1.-1.-1....1..1..1..1..1...-1.-1.-1..1..1
%e .-1..1..1..1..1....1..1..1..1..1...-1.-1.-1.-1.-1...-1..1..1..1..1
%e .-1..1..1..1..1....1..1..1..1..1...-1.-1.-1.-1.-1...-1.-1.-1.-1..1
%e .-1.-1.-1.-1..1...-1.-1.-1.-1.-1....1..1..1..1..1...-1.-1..1..1..1
%K nonn
%O 1,4
%A _R. H. Hardin_ May 05 2013
|
