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.

A215006 a(0)=0, a(n+1) is the least k>a(n) such that k+a(n)+n+1 is a Fibonacci number.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 6
5 10
6 18
7 30
8 51
9 84
10 139
11 227
12 371
13 603
14 980
15 1589
16 2576
17 4172
18 6756
19 10936
20 17701
21 28646
22 46357
23 75013
24 121381
25 196405
26 317798
27 514215
28 832026
29 1346254
30 2178294
31 3524562
32 5702871
33 9227448
34 14930335
35 24157799
36 39088151
37 63245967
38 102334136
39 165580121

List of values

[0, 1, 2, 3, 6, 10, 18, 30, 51, 84, 139, 227, 371, 603, 980, 1589, 2576, 4172, 6756, 10936, 17701, 28646, 46357, 75013, 121381, 196405, 317798, 514215, 832026, 1346254, 2178294, 3524562, 5702871, 9227448, 14930335, 24157799, 39088151, 63245967, 102334136, 165580121]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.