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.

A013655 a(n) = F(n+1) + L(n), where F(n) and L(n) are Fibonacci and Lucas numbers, respectively.

Table of values

n a(n)
0 3
1 2
2 5
3 7
4 12
5 19
6 31
7 50
8 81
9 131
10 212
11 343
12 555
13 898
14 1453
15 2351
16 3804
17 6155
18 9959
19 16114
20 26073
21 42187
22 68260
23 110447
24 178707
25 289154
26 467861
27 757015
28 1224876
29 1981891
30 3206767
31 5188658
32 8395425
33 13584083
34 21979508
35 35563591
36 57543099
37 93106690
38 150649789
39 243756479

List of values

[3, 2, 5, 7, 12, 19, 31, 50, 81, 131, 212, 343, 555, 898, 1453, 2351, 3804, 6155, 9959, 16114, 26073, 42187, 68260, 110447, 178707, 289154, 467861, 757015, 1224876, 1981891, 3206767, 5188658, 8395425, 13584083, 21979508, 35563591, 57543099, 93106690, 150649789, 243756479]