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.

A375347 a(n) is the number of nonnegative numbers k < n such that the congruence x^k == k (mod n) is solvable.

Table of values

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

List of values

[1, 1, 1, 2, 2, 4, 4, 4, 4, 6, 5, 7, 5, 8, 9, 8, 10, 10, 8, 11, 10, 13, 17, 13, 13, 14, 13, 15, 17, 18, 17, 16, 17, 22, 16, 17, 16, 19, 18, 21, 20, 22, 20, 22, 22, 32, 36, 25, 25, 28, 30, 23, 34, 28, 28, 25, 24, 36, 38, 33, 27, 31, 29, 32, 31, 39, 35, 36, 44, 35, 42, 31, 39, 36, 38]

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

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