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.

A307087 a(n) is the number of steps it takes for the sequence f(0)=f(1)=n, f(x)=(a*b) mod (a+b+1), where a=f(x-1) and b=f(x-2), to reach a cycle.

Table of values

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

List of values

[0, 0, 4, 3, 0, 6, 6, 1, 13, 3, 2, 8, 3, 3, 5, 3, 0, 23, 3, 4, 11, 3, 0, 9, 11, 5, 9, 3, 10, 13, 13, 2, 5, 3, 9, 4, 7, 6, 23, 3, 34, 23, 8, 2, 12, 3, 22, 9, 8, 7, 16, 3, 1, 19, 60, 12, 27, 3, 7, 15, 22, 4, 25, 3, 30, 12, 10, 11, 22, 3, 6, 12, 3, 8, 19, 3, 10]