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.

A206826 Number of solutions (n,k) of s(k)=s(n) (mod n), where 1<=k and s(k)=k(k+1)(k+2)/6.

Table of values

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

List of values

[0, 2, 1, 2, 1, 2, 1, 2, 3, 2, 2, 2, 3, 4, 1, 2, 1, 2, 6, 3, 3, 2, 4, 2, 3, 2, 6, 2, 5, 2, 1, 3, 3, 8, 3, 2, 3, 4, 6, 2, 3, 2, 6, 3, 3, 2, 2, 2, 3, 5, 6, 2, 1, 8, 6, 5, 3, 2, 8, 2, 3, 5, 1, 8, 5, 2, 6, 4, 12, 2, 2, 2, 3, 3, 6, 8, 4, 2, 6, 2, 3, 2, 8, 8, 3, 3, 6, 2, 5, 8, 6, 4, 3, 8, 2, 2, 3, 4, 6]