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.

A205450 Least k such that n divides s(k) - s(j) for some j where s(j) is the 2j-th Fibonacci number.

Table of values

n a(n)
1 2
2 2
3 4
4 4
5 3
6 4
7 3
8 6
9 4
10 4
11 6
12 8
13 4
14 7
15 12
16 9
17 5
18 4
19 10
20 4
21 8
22 7
23 7
24 8
25 13
26 5
27 5
28 9
29 8
30 14
31 16
32 15
33 12
34 5
35 11
36 12
37 10
38 10
39 16
40 9
41 6
42 8
43 12
44 16
45 14
46 7
47 5
48 12
49 10
50 14
51 20
52 5
53 14
54 5
55 10
56 9
57 20
58 8
59 30
60 32

List of values

[2, 2, 4, 4, 3, 4, 3, 6, 4, 4, 6, 8, 4, 7, 12, 9, 5, 4, 10, 4, 8, 7, 7, 8, 13, 5, 5, 9, 8, 14, 16, 15, 12, 5, 11, 12, 10, 10, 16, 9, 6, 8, 12, 16, 14, 7, 5, 12, 10, 14, 20, 5, 14, 5, 10, 9, 20, 8, 30, 32]