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.

A348259 Number of bases 1 and coprime to n, such that b^n == b (mod n).

Table of values

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

List of values

[0, 0, 1, 0, 3, 0, 5, 0, 1, 0, 9, 0, 11, 0, 3, 0, 15, 0, 17, 0, 3, 0, 21, 0, 3, 0, 1, 2, 27, 0, 29, 0, 3, 0, 3, 0, 35, 0, 3, 0, 39, 0, 41, 0, 7, 0, 45, 0, 5, 0, 3, 2, 51, 0, 3, 0, 3, 0, 57, 0, 59, 0, 3, 0, 15, 4, 65, 0, 3, 2, 69, 0, 71, 0, 3]