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.

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

List of values

[0, 1, 2, 2, 2, 5, 5, 5, 8, 7, 6, 5, 5, 12, 11, 10, 16, 17, 12, 17, 5, 17, 13, 5, 5, 5, 26, 26, 26, 26, 26, 26, 26, 33, 26, 29, 26, 31, 26, 37, 32, 26, 36, 26, 26, 33, 43, 26, 47, 30, 50, 26, 41, 53, 50, 26, 50, 50, 30, 50, 53, 57, 47, 37, 57, 26, 56, 65, 59]

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

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