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.

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

Table of values

n a(n)
1 3
2 3
3 21
4 21
5 8
6 21
7 8
8 144
9 21
10 21
11 144
12 987
13 21
14 377
15 46368
16 2584
17 55
18 21
19 6765
20 21
21 987
22 377
23 377
24 987
25 121393
26 55
27 55
28 2584
29 987
30 317811
31 2178309
32 832040
33 46368
34 55
35 17711
36 46368
37 6765
38 6765
39 2178309
40 2584
41 144
42 987
43 46368
44 2178309
45 317811

List of values

[3, 3, 21, 21, 8, 21, 8, 144, 21, 21, 144, 987, 21, 377, 46368, 2584, 55, 21, 6765, 21, 987, 377, 377, 987, 121393, 55, 55, 2584, 987, 317811, 2178309, 832040, 46368, 55, 17711, 46368, 6765, 6765, 2178309, 2584, 144, 987, 46368, 2178309, 317811]