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.

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

Table of values

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

List of values

[2, 3, 3, 3, 6, 4, 5, 4, 7, 7, 4, 4, 8, 6, 11, 5, 10, 7, 6, 7, 5, 6, 13, 7, 26, 9, 19, 6, 5, 12, 9, 5, 5, 10, 21, 7, 20, 6, 15, 16, 11, 6, 23, 6, 31, 13, 9, 7, 29, 27, 19, 9, 28, 19, 6, 13, 7, 7, 16, 12]