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.

A205444 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=Fibonacci(2j-1).

Table of values

n a(n)
1 2
2 5
3 5
4 5
5 89
6 13
7 34
8 13
9 233
10 233
11 13
12 13
13 610
14 89
15 10946
16 34
17 4181
18 233
19 89
20 233
21 34
22 89
23 75025
24 233
25 20365011074
26 1597
27 24157817
28 89
29 34
30 28657
31 1597
32 34
33 34
34 4181
35 165580141
36 233
37 63245986
38 89
39 514229
40 1346269
41 10946
42 89
43 1134903170

List of values

[2, 5, 5, 5, 89, 13, 34, 13, 233, 233, 13, 13, 610, 89, 10946, 34, 4181, 233, 89, 233, 34, 89, 75025, 233, 20365011074, 1597, 24157817, 89, 34, 28657, 1597, 34, 34, 4181, 165580141, 233, 63245986, 89, 514229, 1346269, 10946, 89, 1134903170]