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.

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

Table of values

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

List of values

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