cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A318557 Number A(n,k) of n-member subsets of [k*n] whose elements sum to a multiple of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 1
8 1
9 0
10 1
11 1
12 2
13 1
14 0
15 1
16 1
17 5
18 10
19 1
20 0
21 1
22 1
23 6
24 30
25 38
26 1
27 0
28 1
29 1
30 9
31 55
32 165
33 126
34 1
35 0
36 1
37 1
38 10
39 91
40 460
41 1001
42 452
43 1
44 0
45 1
46 1
47 13
48 138
49 969
50 3876
51 6198
52 1716
53 1
54 0
55 1
56 1
57 14
58 190
59 1782
60 10630
61 33594
62 38760
63 6470
64 1
65 0
66 1
67 1
68 17
69 253
70 2925
71 23751
72 118755
73 296010
74 245157
75 24310
76 1
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 5, 10, 1, 0, 1, 1, 6, 30, 38, 1, 0, 1, 1, 9, 55, 165, 126, 1, 0, 1, 1, 10, 91, 460, 1001, 452, 1, 0, 1, 1, 13, 138, 969, 3876, 6198, 1716, 1, 0, 1, 1, 14, 190, 1782, 10630, 33594, 38760, 6470, 1, 0, 1, 1, 17, 253, 2925, 23751, 118755, 296010, 245157, 24310, 1, 0]