cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Table of values

n a(n)
1 0
2 1113
3 0
4 103583
5 0
6 2102597
7 0
8 20044255
9 0
10 121558241
11 0
12 545572495
13 0
14 1975264495
15 0
16 6087969941
17 0
18 16555930825
19 0
20 40733826807
21 0
22 92339940289
23 0
24 195519292147
25 0
26 390766431925
27 0
28 743286869427
29 0
30 1354483437063
31 0

List of values

[0, 1113, 0, 103583, 0, 2102597, 0, 20044255, 0, 121558241, 0, 545572495, 0, 1975264495, 0, 6087969941, 0, 16555930825, 0, 40733826807, 0, 92339940289, 0, 195519292147, 0, 390766431925, 0, 743286869427, 0, 1354483437063, 0]