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.

A294864 Solution of the complementary equation a(n) = a(n-2) + b(n-2) + n, 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 6
3 9
4 15
5 21
6 29
7 38
8 48
9 59
10 71
11 84
12 99
13 114
14 131
15 148
16 167
17 187
18 208
19 230
20 253
21 277
22 302
23 328
24 356
25 384
26 414
27 444
28 476
29 508
30 542
31 576
32 613
33 649
34 688
35 726
36 767
37 807
38 850
39 892
40 937
41 982
42 1029
43 1076
44 1125
45 1174
46 1225
47 1276
48 1329
49 1382
50 1437
51 1493
52 1550

List of values

[1, 2, 6, 9, 15, 21, 29, 38, 48, 59, 71, 84, 99, 114, 131, 148, 167, 187, 208, 230, 253, 277, 302, 328, 356, 384, 414, 444, 476, 508, 542, 576, 613, 649, 688, 726, 767, 807, 850, 892, 937, 982, 1029, 1076, 1125, 1174, 1225, 1276, 1329, 1382, 1437, 1493, 1550]