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.

A205837 Numbers k for which 2 divides s(k)-s(j) for some j each k occurs once for each such j; s(k) denotes the (k+1)-st Fibonacci number.

Table of values

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

List of values

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