A098966 - cp's OEIS frontend

A098966 Number of (k+1)-tuples of integers modulo n (x_1,...,x_k,s) such that at least one subset of the x_i sums to s mod n. In other words, n^k times the expected number of distinct subset sums mod n of k integers mod n chosen uniformly at random. Read by antidiagonals, i.e., with entries in the order (n,k)=(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...

n	a(n)
1	1
2	1
3	3
4	1
5	7
6	5
7	1
8	15
9	21
10	7
11	1
12	31
13	73
14	43
15	9
16	1
17	63
18	233
19	215
20	73
21	11
22	1
23	127
24	717
25	951
26	497
27	111
28	13
29	1
30	255
31	2173
32	3971
33	2865
34	959
35	157
36	15
37	1
38	511
39	6545
40	16171
41	15161
42	6863
43	1657
44	211
45	17
46	1
47	1023
48	19665
49	65167
50	77369
51	44391
52	14521
53	2631
54	273
55	19

[1, 1, 3, 1, 7, 5, 1, 15, 21, 7, 1, 31, 73, 43, 9, 1, 63, 233, 215, 73, 11, 1, 127, 717, 951, 497, 111, 13, 1, 255, 2173, 3971, 2865, 959, 157, 15, 1, 511, 6545, 16171, 15161, 6863, 1657, 211, 17, 1, 1023, 19665, 65167, 77369, 44391, 14521, 2631, 273, 19]

cp's OEIS Frontend

Table of values

List of values