A225345 - cp's OEIS frontend

A225345 T(n,k) = Number of n X k {-1,1}-arrays such that the sum over i=1..n,j=1..k of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute k-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship).

n	a(n)
1	0
2	1
3	0
4	0
5	1
6	0
7	1
8	0
9	1
10	2
11	0
12	1
13	0
14	3
15	0
16	1
17	0
18	3
19	6
20	7
21	0
22	0
23	1
24	0
25	9
26	0
27	15
28	0
29	1
30	0
31	3
32	12
33	31
34	0
35	33
36	8
37	0
38	1
39	0
40	17
41	0
42	107
43	0
44	77
45	0
46	1
47	0
48	5
49	22
50	81
51	0
52	395
53	410
54	181
55	0
56	0
57	1
58	0
59	27
60	0
61	397
62	0
63	1525
64	0
65	443
66	0
67	1
68	0
69	5
70	34
71	171
72	0
73	2073
74	4508
75	6095
76	0
77	1113
78	58
79	0
80	1
81	0
82	41
83	0
84	1081
85	0

[0, 1, 0, 0, 1, 0, 1, 0, 1, 2, 0, 1, 0, 3, 0, 1, 0, 3, 6, 7, 0, 0, 1, 0, 9, 0, 15, 0, 1, 0, 3, 12, 31, 0, 33, 8, 0, 1, 0, 17, 0, 107, 0, 77, 0, 1, 0, 5, 22, 81, 0, 395, 410, 181, 0, 0, 1, 0, 27, 0, 397, 0, 1525, 0, 443, 0, 1, 0, 5, 34, 171, 0, 2073, 4508, 6095, 0, 1113, 58, 0, 1, 0, 41, 0, 1081, 0]

cp's OEIS Frontend

A225345 T(n,k) = Number of n X k {-1,1}-arrays such that the sum over i=1..n,j=1..k of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute k-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship).

Table of values

List of values