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.

A379863 a(n) is the number of steps in a Pollard rho like integer factorization algorithm for m = 2*n + 1 with f(x) = 2^x mod m and starting from x = y = 1.

Table of values

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

List of values

[2, 3, 2, 3, 5, 9, 3, 4, 10, 2, 6, 7, 2, 10, 3, 2, 3, 26, 2, 7, 2, 2, 4, 3, 2, 42, 4, 2, 21, 32, 2, 3, 52, 2, 6, 4, 2, 5, 6, 2, 73, 4, 2, 5, 3, 2, 4, 10, 2, 33, 10, 2, 7, 9, 2, 7, 7, 2, 6, 27, 2, 5, 2, 2, 93, 5, 2, 15, 53, 2, 7, 4, 2, 19, 3, 2, 3, 6, 2, 9, 126]