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.

A332965 a(n) is the number of distinct values in the sequence s defined by s(1) = 0 and for any k > 0, s(k+1) = (s(k)^2+1) mod n.

Table of values

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

List of values

[1, 2, 3, 3, 3, 4, 4, 4, 5, 6, 6, 4, 4, 5, 5, 5, 8, 8, 6, 7, 4, 6, 8, 4, 4, 4, 5, 5, 11, 8, 5, 5, 6, 8, 6, 8, 6, 7, 6, 8, 7, 5, 8, 6, 5, 8, 14, 5, 9, 7, 8, 5, 9, 8, 10, 5, 6, 11, 11, 8, 15, 6, 6, 6, 12, 6, 12, 8, 8, 9, 18, 8, 9, 7, 5, 7, 6, 6, 8, 9, 11, 14, 11]