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.

A295070 Solution of the complementary equation a(n) = a(n-2) + b(n-1) + b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.

Table of values

n a(n)
0 1
1 2
2 8
3 11
4 19
5 24
6 35
7 43
8 57
9 68
10 84
11 97
12 115
13 130
14 150
15 168
16 191
17 211
18 236
19 259
20 287
21 312
22 342
23 369
24 401
25 430
26 464
27 495
28 531
29 565
30 604
31 640
32 681
33 719
34 762
35 802
36 848
37 891
38 939
39 984
40 1034
41 1081
42 1133
43 1182
44 1236
45 1287
46 1343
47 1396
48 1454
49 1510
50 1571
51 1629

List of values

[1, 2, 8, 11, 19, 24, 35, 43, 57, 68, 84, 97, 115, 130, 150, 168, 191, 211, 236, 259, 287, 312, 342, 369, 401, 430, 464, 495, 531, 565, 604, 640, 681, 719, 762, 802, 848, 891, 939, 984, 1034, 1081, 1133, 1182, 1236, 1287, 1343, 1396, 1454, 1510, 1571, 1629]