Number of 10Xn -1,1 arrays such that the sum over i=1..10,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 10 fore-aft positions so that there are no turning moments on the ship).
A225350
Number of 10Xn -1,1 arrays such that the sum over i=1..10,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 10 fore-aft positions so that there are no turning moments on the ship).
Terms
- a(0) =0a(1) =443a(2) =0a(3) =24893a(4) =0a(5) =360909a(6) =0a(7) =2676331a(8) =0a(9) =13280209a(10) =0a(11) =50435657a(12) =0a(13) =158259755a(14) =0a(15) =430394067a(16) =0a(17) =1047240813a(18) =0a(19) =2331232209a(20) =0a(21) =4825180007a(22) =0a(23) =9399464741a(24) =0a(25) =17394354077a(26) =0a(27) =30804515135a(28) =0a(29) =52513235123
External references
- oeis: A225350