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.

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

Table of values

n a(n)
1 0
2 443
3 0
4 24893
5 0
6 360909
7 0
8 2676331
9 0
10 13280209
11 0
12 50435657
13 0
14 158259755
15 0
16 430394067
17 0
18 1047240813
19 0
20 2331232209
21 0
22 4825180007
23 0
24 9399464741
25 0
26 17394354077
27 0
28 30804515135
29 0
30 52513235123
31 0
32 86584738985
33 0
34 138623327831
35 0

List of values

[0, 443, 0, 24893, 0, 360909, 0, 2676331, 0, 13280209, 0, 50435657, 0, 158259755, 0, 430394067, 0, 1047240813, 0, 2331232209, 0, 4825180007, 0, 9399464741, 0, 17394354077, 0, 30804515135, 0, 52513235123, 0, 86584738985, 0, 138623327831, 0]