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.

A294868 Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) -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 5
3 12
4 24
5 42
6 67
7 100
8 142
9 195
10 260
11 338
12 430
13 537
14 660
15 800
16 958
17 1135
18 1332
19 1550
20 1791
21 2056
22 2346
23 2662
24 3005
25 3376
26 3776
27 4206
28 4667
29 5160
30 5686
31 6246
32 6841
33 7472
34 8140
35 8846
36 9591
37 10377
38 11205
39 12076
40 12991
41 13951
42 14957
43 16010
44 17111
45 18261

List of values

[1, 2, 5, 12, 24, 42, 67, 100, 142, 195, 260, 338, 430, 537, 660, 800, 958, 1135, 1332, 1550, 1791, 2056, 2346, 2662, 3005, 3376, 3776, 4206, 4667, 5160, 5686, 6246, 6841, 7472, 8140, 8846, 9591, 10377, 11205, 12076, 12991, 13951, 14957, 16010, 17111, 18261]