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.

A050055 a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 12
6 14
7 20
8 34
9 68
10 70
11 76
12 90
13 124
14 194
15 284
16 478
17 956
18 958
19 964
20 978
21 1012
22 1082
23 1172
24 1366
25 1844
26 2802
27 3780
28 4862
29 6228
30 9030
31 13892
32 22922
33 45844
34 45846
35 45852
36 45866
37 45900
38 45970
39 46060
40 46254
41 46732

List of values

[1, 2, 4, 6, 12, 14, 20, 34, 68, 70, 76, 90, 124, 194, 284, 478, 956, 958, 964, 978, 1012, 1082, 1172, 1366, 1844, 2802, 3780, 4862, 6228, 9030, 13892, 22922, 45844, 45846, 45852, 45866, 45900, 45970, 46060, 46254, 46732]