A309148 - cp's OEIS frontend

A309148 A(n,k) is (1/k) times the number of n-member subsets of [k*n] whose elements sum to a multiple of n; square array A(n,k), n>=1, k>=1, read by antidiagonals.

n	a(n)
1	1
2	1
3	0
4	1
5	1
6	1
7	1
8	2
9	4
10	0
11	1
12	3
13	10
14	9
15	1
16	1
17	4
18	19
19	42
20	26
21	0
22	1
23	5
24	31
25	115
26	201
27	76
28	1
29	1
30	6
31	46
32	244
33	776
34	1028
35	246
36	0
37	1
38	7
39	64
40	445
41	2126
42	5601
43	5538
44	809
45	1
46	1
47	8
48	85
49	734
50	4751
51	19780
52	42288
53	30666
54	2704
55	0
56	1
57	9
58	109
59	1127
60	9276
61	54086
62	192130
63	328755
64	173593
65	9226
66	1

[1, 1, 0, 1, 1, 1, 1, 2, 4, 0, 1, 3, 10, 9, 1, 1, 4, 19, 42, 26, 0, 1, 5, 31, 115, 201, 76, 1, 1, 6, 46, 244, 776, 1028, 246, 0, 1, 7, 64, 445, 2126, 5601, 5538, 809, 1, 1, 8, 85, 734, 4751, 19780, 42288, 30666, 2704, 0, 1, 9, 109, 1127, 9276, 54086, 192130, 328755, 173593, 9226, 1]

cp's OEIS Frontend

A309148 A(n,k) is (1/k) times the number of n-member subsets of [k*n] whose elements sum to a multiple of n; square array A(n,k), n>=1, k>=1, read by antidiagonals.

Table of values

List of values