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.

A294860 Solution of the equation a(n) = a(n-2) + b(n-2), where a( ) and b( ) are increasing sequences of positive integers such that every positive integer is in one of them and only one term is in both.

Table of values

n a(n)
0 1
1 2
2 4
3 6
4 9
5 13
6 17
7 23
8 28
9 35
10 42
11 50
12 58
13 68
14 77
15 88
16 98
17 110
18 122
19 135
20 148
21 162
22 177
23 192
24 208
25 224
26 241
27 258
28 277
29 295
30 315
31 334
32 355
33 375
34 398
35 419
36 443
37 465
38 490
39 513
40 539
41 564
42 591
43 617
44 645
45 672
46 701
47 729
48 760
49 789
50 821
51 851
52 884
53 915
54 949
55 981

List of values

[1, 2, 4, 6, 9, 13, 17, 23, 28, 35, 42, 50, 58, 68, 77, 88, 98, 110, 122, 135, 148, 162, 177, 192, 208, 224, 241, 258, 277, 295, 315, 334, 355, 375, 398, 419, 443, 465, 490, 513, 539, 564, 591, 617, 645, 672, 701, 729, 760, 789, 821, 851, 884, 915, 949, 981]