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.

A345347 Find the largest k with F(k) <= n, where F(k) is the k-th Fibonacci number. a(n) = F(k+2) + n.

Table of values

n a(n)
0 1
1 4
2 7
3 11
4 12
5 18
6 19
7 20
8 29
9 30
10 31
11 32
12 33
13 47
14 48
15 49
16 50
17 51
18 52
19 53
20 54
21 76
22 77
23 78
24 79
25 80
26 81
27 82
28 83
29 84
30 85
31 86
32 87
33 88
34 123
35 124
36 125
37 126
38 127
39 128
40 129
41 130
42 131
43 132
44 133
45 134
46 135
47 136
48 137
49 138
50 139
51 140
52 141
53 142
54 143
55 199
56 200
57 201
58 202
59 203
60 204

List of values

[1, 4, 7, 11, 12, 18, 19, 20, 29, 30, 31, 32, 33, 47, 48, 49, 50, 51, 52, 53, 54, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 199, 200, 201, 202, 203, 204]