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.

A334006 Triangle read by rows: T(n,k) = (the number of nonnegative bases m < n such that m^k == m (mod n))/(the number of nonnegative bases m < n such that -m^k == m (mod n)) for nonnegative k < n, n >= 1.

Table of values

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

List of values

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