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.

A376010 a(n) is the smallest distance between a pair of equal terms in the sequence s(0) = 1, s(1) = r, and s(k) = s(k-1)^2/(4*s(k-2)) mod p for k>=2, where p = prime(n) (=A000040(n)) and r is a primitive root modulo p.

Table of values

n a(n)
2 2
3 2
4 2
5 2
6 2
7 16
8 2
9 2
10 2
11 6
12 2
13 8
14 6
15 2
16 2
17 2
18 2
19 2
20 2
21 8
22 2
23 2
24 8
25 32
26 2
27 2
28 2
29 54
30 16
31 18
32 2
33 8
34 2
35 2
36 50
37 6
38 2
39 2
40 2
41 2
42 2
43 2
44 64
45 2
46 2
47 2
48 6
49 2
50 6
51 8
52 2
53 80
54 250
55 256
56 2
57 2
58 2
59 6
60 8
61 6
62 2
63 18
64 2
65 8
66 2
67 22
68 16
69 2
70 2
71 32
72 2
73 2
74 2
75 2
76 2
77 2
78 18
79 16
80 8
81 2
82 2
83 10
84 432
85 6
86 2
87 64
88 24
89 2
90 2
91 2
92 2
93 2
94 2
95 6
96 2
97 2
98 8
99 2
100 2
101 2
102 2
103 2
104 8
105 10
106 64
107 2
108 16
109 2
110 24
111 2
112 2
113 8
114 2
115 14
116 640
117 6

List of values

[2, 2, 2, 2, 2, 16, 2, 2, 2, 6, 2, 8, 6, 2, 2, 2, 2, 2, 2, 8, 2, 2, 8, 32, 2, 2, 2, 54, 16, 18, 2, 8, 2, 2, 50, 6, 2, 2, 2, 2, 2, 2, 64, 2, 2, 2, 6, 2, 6, 8, 2, 80, 250, 256, 2, 2, 2, 6, 8, 6, 2, 18, 2, 8, 2, 22, 16, 2, 2, 32, 2, 2, 2, 2, 2, 2, 18, 16, 8, 2, 2, 10, 432, 6, 2, 64, 24, 2, 2, 2, 2, 2, 2, 6, 2, 2, 8, 2, 2, 2, 2, 2, 8, 10, 64, 2, 16, 2, 24, 2, 2, 8, 2, 14, 640, 6]