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.

A328699 Start with 0, a(n) is the smallest number of iterations: x -> (x^2+1) mod n needed to run into a cycle.

Table of values

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

List of values

[0, 0, 2, 1, 0, 2, 3, 2, 2, 0, 4, 2, 0, 3, 2, 3, 2, 2, 5, 1, 3, 4, 6, 2, 1, 0, 2, 3, 9, 2, 4, 3, 4, 2, 3, 2, 5, 5, 2, 2, 0, 3, 7, 4, 2, 6, 10, 3, 3, 1, 2, 1, 7, 2, 4, 3, 5, 9, 8, 2, 5, 4, 3, 4, 0, 4, 10, 2, 6, 3, 7, 2, 3, 5, 2, 5, 4, 2, 4, 3, 2, 0, 6, 3, 2, 7, 9, 4, 2, 2, 3]