A068009 - cp's OEIS frontend

A068009 Square array T(m,n) with m (row) >= 1 and n (column) >= 0 read by antidiagonals: number of subsets of {1,2,3,...n} that sum to 0 mod m (including the empty set, whose sum is 0).

n	a(n)
0	1
1	2
2	1
3	4
4	1
5	1
6	8
7	2
8	1
9	1
10	16
11	4
12	2
13	1
14	1
15	32
16	8
17	4
18	1
19	1
20	1
21	64
22	16
23	6
24	2
25	1
26	1
27	1
28	128
29	32
30	12
31	4
32	2
33	1
34	1
35	1
36	256
37	64
38	24
39	8
40	4
41	2
42	1
43	1
44	1
45	512
46	128
47	44
48	16
49	8
50	3
51	1
52	1
53	1
54	1
55	1024
56	256
57	88
58	32
59	14
60	6
61	3
62	1
63	1
64	1
65	1
66	2048
67	512
68	176
69	64
70	26
71	12
72	5
73	2
74	1
75	1
76	1
77	1
78	4096
79	1024
80	344
81	128
82	52
83	22
84	10
85	4
86	2
87	1
88	1
89	1
90	1

[1, 2, 1, 4, 1, 1, 8, 2, 1, 1, 16, 4, 2, 1, 1, 32, 8, 4, 1, 1, 1, 64, 16, 6, 2, 1, 1, 1, 128, 32, 12, 4, 2, 1, 1, 1, 256, 64, 24, 8, 4, 2, 1, 1, 1, 512, 128, 44, 16, 8, 3, 1, 1, 1, 1, 1024, 256, 88, 32, 14, 6, 3, 1, 1, 1, 1, 2048, 512, 176, 64, 26, 12, 5, 2, 1, 1, 1, 1, 4096, 1024, 344, 128, 52, 22, 10, 4, 2, 1, 1, 1, 1]

cp's OEIS Frontend

A068009 Square array T(m,n) with m (row) >= 1 and n (column) >= 0 read by antidiagonals: number of subsets of {1,2,3,...n} that sum to 0 mod m (including the empty set, whose sum is 0).

Table of values

List of values