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.

A050051 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) = 3.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 10
6 12
7 17
8 29
9 58
10 60
11 65
12 77
13 106
14 166
15 243
16 409
17 818
18 820
19 825
20 837
21 866
22 926
23 1003
24 1169
25 1578
26 2398
27 3235
28 4161
29 5330
30 7728
31 11889
32 19617
33 39234
34 39236
35 39241
36 39253
37 39282
38 39342
39 39419
40 39585
41 39994
42 40814

List of values

[1, 2, 3, 5, 10, 12, 17, 29, 58, 60, 65, 77, 106, 166, 243, 409, 818, 820, 825, 837, 866, 926, 1003, 1169, 1578, 2398, 3235, 4161, 5330, 7728, 11889, 19617, 39234, 39236, 39241, 39253, 39282, 39342, 39419, 39585, 39994, 40814]