Number of 6Xn -1,1 arrays such that the sum over i=1..6,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 6 fore-aft positions so that there are no turning moments on the ship).

A225346

Number of 6Xn -1,1 arrays such that the sum over i=1..6,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 6 fore-aft positions so that there are no turning moments on the ship).

Terms

    a(0) =0a(1) =15a(2) =0a(3) =107a(4) =0a(5) =397a(6) =0a(7) =1081a(8) =0a(9) =2399a(10) =0a(11) =4675a(12) =0a(13) =8273a(14) =0a(15) =13641a(16) =0a(17) =21267a(18) =0a(19) =31731a(20) =0a(21) =45637a(22) =0a(23) =63697a(24) =0a(25) =86635a(26) =0a(27) =115291a(28) =0a(29) =150513

External references