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.

A294861 Solution of the complementary equation a(n) = a(n-2) + b(n-2) + 1, 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 7
4 12
5 16
6 22
7 27
8 34
9 41
10 49
11 57
12 67
13 76
14 87
15 97
16 109
17 121
18 134
19 147
20 161
21 176
22 191
23 207
24 223
25 240
26 257
27 276
28 294
29 314
30 333
31 354
32 374
33 397
34 418
35 442
36 464
37 489
38 512
39 538
40 563
41 590
42 616
43 644
44 671
45 700
46 728
47 759
48 788
49 820
50 850
51 883
52 914
53 948
54 980

List of values

[1, 2, 5, 7, 12, 16, 22, 27, 34, 41, 49, 57, 67, 76, 87, 97, 109, 121, 134, 147, 161, 176, 191, 207, 223, 240, 257, 276, 294, 314, 333, 354, 374, 397, 418, 442, 464, 489, 512, 538, 563, 590, 616, 644, 671, 700, 728, 759, 788, 820, 850, 883, 914, 948, 980]

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

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