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.

A343722 a(n) is the number of starting residues r modulo n from which repeated iterations of the mapping r -> r^2 mod n never reach a fixed point.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 4, 0, 4, 0, 8, 0, 8, 8, 0, 0, 0, 8, 16, 0, 12, 16, 20, 0, 16, 16, 16, 16, 24, 0, 28, 0, 24, 0, 20, 16, 32, 32, 24, 0, 32, 24, 40, 32, 20, 40, 44, 0, 40, 32, 0, 32, 48, 32, 40, 32, 48, 48, 56, 0, 56, 56, 48, 0, 40, 48, 64, 0, 60, 40, 68, 32]