Number of 11Xn -1,1 arrays such that the sum over i=1..11,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 11 fore-aft positions so that there are no turning moments on the ship).
A225351
Number of 11Xn -1,1 arrays such that the sum over i=1..11,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 11 fore-aft positions so that there are no turning moments on the ship).
Terms
- a(0) =0a(1) =1113a(2) =0a(3) =103583a(4) =0a(5) =2102597a(6) =0a(7) =20044255a(8) =0a(9) =121558241a(10) =0a(11) =545572495a(12) =0a(13) =1975264495a(14) =0a(15) =6087969941a(16) =0a(17) =16555930825a(18) =0a(19) =40733826807a(20) =0a(21) =92339940289a(22) =0a(23) =195519292147a(24) =0a(25) =390766431925a(26) =0a(27) =743286869427a(28) =0a(30) =0
External references
- oeis: A225351