A225312 - cp's OEIS frontend

A225312 Number of 5 X n -1,1 arrays such that the sum over i=1..5,j=1..n of i*x(i,j) is zero and rows are nondecreasing (ways to put n thrusters pointing east or west at each of 5 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).

n	a(n)
1	0
2	15
3	0
4	113
5	0
6	427
7	0
8	1165
9	0
10	2591
11	0
12	5053
13	0
14	8947
15	0
16	14759
17	0
18	23017
19	0
20	34347
21	0
22	49409
23	0
24	68967
25	0
26	93813
27	0
28	124851
29	0
30	163005
31	0
32	209317
33	0
34	264843
35	0
36	330765
37	0
38	408271
39	0
40	498681
41	0
42	603315
43	0
44	723633
45	0
46	861087
47	0
48	1017275
49	0
50	1193781
51	0

[0, 15, 0, 113, 0, 427, 0, 1165, 0, 2591, 0, 5053, 0, 8947, 0, 14759, 0, 23017, 0, 34347, 0, 49409, 0, 68967, 0, 93813, 0, 124851, 0, 163005, 0, 209317, 0, 264843, 0, 330765, 0, 408271, 0, 498681, 0, 603315, 0, 723633, 0, 861087, 0, 1017275, 0, 1193781, 0]

cp's OEIS Frontend

A225312 Number of 5 X n -1,1 arrays such that the sum over i=1..5,j=1..n of i*x(i,j) is zero and rows are nondecreasing (ways to put n thrusters pointing east or west at each of 5 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).

Table of values

List of values