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.

A354057 Square array read by ascending antidiagonals: T(n,k) is the number of solutions to x^k == 1 (mod n).

Table of values

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

List of values

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