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.

A337633 Triangle read by rows: T(n,k) is the number of nonnegative integers m < n such that m^k + m == 0 (mod n), where 0 <= k < n.

Table of values

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

List of values

[1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 1, 2, 3, 2, 1, 2, 4, 2, 4, 2, 1, 1, 2, 1, 4, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 1, 2, 1, 2, 1, 2, 4, 6, 4, 2, 4, 6, 4, 2, 1, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 2, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 1, 1, 2, 3, 4, 1, 2, 7, 2]