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.

A343073 a(n) is the number of integers 0 < b < n such that b^^x == 1 (mod n) has a solution; ^^ denotes the tetration operation (cf. A321312).

Table of values

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

List of values

[1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 6, 2, 5, 1, 9, 1, 5, 1, 3, 3, 2, 1, 3, 3, 2, 2, 5, 1, 3, 1, 5, 1, 8, 1, 9, 2, 5, 1, 8, 1, 6, 3, 5, 1, 2, 1, 4, 1, 17, 2, 5, 1, 5, 2, 3, 3, 3, 1, 7, 3, 3, 1, 15, 2, 5, 1, 5, 2, 4, 1, 16, 4, 5, 3, 10, 1, 5]