A225310 - cp's OEIS frontend

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

n	a(n)
1	0
2	1
3	0
4	0
5	1
6	2
7	1
8	0
9	3
10	2
11	0
12	3
13	6
14	7
15	0
16	1
17	0
18	9
19	16
20	15
21	0
22	0
23	3
24	12
25	31
26	0
27	35
28	8
29	1
30	0
31	17
32	52
33	113
34	0
35	87
36	14
37	0
38	5
39	22
40	83
41	0
42	443
43	474
44	217
45	0
46	1
47	0
48	27
49	122
50	427
51	0
52	1787
53	1576
54	547
55	0
56	0
57	5
58	34
59	175
60	0
61	2341
62	5304
63	7445
64	0
65	1417
66	70
67	1
68	0
69	41
70	238
71	1165
72	0
73	13333
74	26498

[0, 1, 0, 0, 1, 2, 1, 0, 3, 2, 0, 3, 6, 7, 0, 1, 0, 9, 16, 15, 0, 0, 3, 12, 31, 0, 35, 8, 1, 0, 17, 52, 113, 0, 87, 14, 0, 5, 22, 83, 0, 443, 474, 217, 0, 1, 0, 27, 122, 427, 0, 1787, 1576, 547, 0, 0, 5, 34, 175, 0, 2341, 5304, 7445, 0, 1417, 70, 1, 0, 41, 238, 1165, 0, 13333, 26498]

cp's OEIS Frontend

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

Table of values

List of values