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.

A267632 Triangle T(n, k) read by rows: the k-th column of the n-th row lists the number of ways to select k distinct numbers (k >= 1) from [1..n] so that their sum is divisible by n.

Table of values

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

List of values

[1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 2, 2, 1, 1, 1, 2, 4, 3, 1, 0, 1, 3, 5, 5, 3, 1, 1, 1, 3, 7, 9, 7, 3, 1, 0, 1, 4, 10, 14, 14, 10, 4, 1, 1, 1, 4, 12, 22, 26, 20, 12, 5, 1, 0, 1, 5, 15, 30, 42, 42, 30, 15, 5, 1, 1, 1, 5, 19, 42, 66, 76, 66, 43, 19, 5, 1, 0]