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.

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

List of values

[1, 1, 2, 1, 3, 2, 1, 4, 2, 3, 1, 5, 2, 3, 2, 1, 6, 4, 6, 4, 6, 1, 7, 2, 3, 4, 3, 2, 1, 8, 2, 5, 2, 5, 2, 5, 1, 9, 2, 3, 4, 3, 2, 7, 2, 1, 10, 4, 6, 4, 10, 4, 6, 4, 10, 1, 11, 2, 3, 2, 3, 6, 3, 2, 3, 2, 1, 12, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 1, 13, 2, 3, 4, 5, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.