A225313 - cp's OEIS frontend

A225313 Number of 6Xn -1,1 arrays such that the sum over i=1..6,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 6 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).

n	a(n)
1	0
2	35
3	0
4	443
5	0
6	2341
7	0
8	8221
9	0
10	22351
11	0
12	51521
13	0
14	105247
15	0
16	196779
17	0
18	342979
19	0
20	565693
21	0
22	891247
23	0
24	1352233
25	0
26	1986519
27	0
28	2839617
29	0
30	3963039
31	0
32	5417341
33	0
34	7269805
35	0
36	9598181
37	0
38	12487593
39	0
40	16035169
41	0
42	20345971
43	0
44	25538619
45	0

[0, 35, 0, 443, 0, 2341, 0, 8221, 0, 22351, 0, 51521, 0, 105247, 0, 196779, 0, 342979, 0, 565693, 0, 891247, 0, 1352233, 0, 1986519, 0, 2839617, 0, 3963039, 0, 5417341, 0, 7269805, 0, 9598181, 0, 12487593, 0, 16035169, 0, 20345971, 0, 25538619, 0]

cp's OEIS Frontend

A225313 Number of 6Xn -1,1 arrays such that the sum over i=1..6,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 6 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).

Table of values

List of values