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.

A061865 Triangle in which the k-th item in the n-th row (both starting from 1) is the number of ways in which we can add k distinct integers from 1 to n, in such a way that the sum is divisible by k.

Table of values

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

List of values

[1, 2, 0, 3, 1, 1, 4, 2, 2, 0, 5, 4, 4, 1, 1, 6, 6, 8, 4, 2, 0, 7, 9, 13, 9, 5, 1, 1, 8, 12, 20, 18, 12, 4, 2, 0, 9, 16, 30, 32, 26, 14, 6, 1, 1, 10, 20, 42, 54, 52, 34, 18, 6, 2, 0, 11, 25, 57, 84, 94, 76, 48, 21, 7, 1, 1, 12, 30, 76, 126, 160, 152, 114, 64, 26, 6, 2, 0, 13, 36, 98, 181, 259, 284, 246, 163, 81, 28, 8, 1, 1]