A309106 - cp's OEIS frontend

A309106 Triangular array T(m,n): number of sequences of n residues modulo m such that no nonempty subsequence sums to zero, for m>=1, n=0..m-1.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	2
7	1
8	3
9	6
10	2
11	1
12	4
13	12
14	16
15	4
16	1
17	5
18	20
19	44
20	10
21	2
22	1
23	6
24	30
25	96
26	90
27	36
28	6
29	1
30	7
31	42
32	174
33	240
34	84
35	28
36	4
37	1
38	8
39	56
40	288
41	690
42	336
43	168
44	48
45	6
46	1
47	9
48	72
49	440
50	1344
51	984
52	336
53	144
54	36
55	4
56	1
57	10
58	90
59	640
60	2590
61	3060
62	2100
63	1200
64	450
65	100
66	10

[1, 1, 1, 1, 2, 2, 1, 3, 6, 2, 1, 4, 12, 16, 4, 1, 5, 20, 44, 10, 2, 1, 6, 30, 96, 90, 36, 6, 1, 7, 42, 174, 240, 84, 28, 4, 1, 8, 56, 288, 690, 336, 168, 48, 6, 1, 9, 72, 440, 1344, 984, 336, 144, 36, 4, 1, 10, 90, 640, 2590, 3060, 2100, 1200, 450, 100, 10]

cp's OEIS Frontend

A309106 Triangular array T(m,n): number of sequences of n residues modulo m such that no nonempty subsequence sums to zero, for m>=1, n=0..m-1.

Table of values

List of values