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.

A050054 a(n) = a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p 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 5
5 7
6 8
7 10
8 14
9 19
10 20
11 22
12 26
13 31
14 38
15 46
16 56
17 70
18 71
19 73
20 77
21 82
22 89
23 97
24 107
25 121
26 140
27 160
28 182
29 208
30 239
31 277
32 323
33 379
34 380
35 382
36 386
37 391
38 398
39 406
40 416
41 430
42 449
43 469
44 491
45 517
46 548
47 586
48 632

List of values

[1, 2, 4, 5, 7, 8, 10, 14, 19, 20, 22, 26, 31, 38, 46, 56, 70, 71, 73, 77, 82, 89, 97, 107, 121, 140, 160, 182, 208, 239, 277, 323, 379, 380, 382, 386, 391, 398, 406, 416, 430, 449, 469, 491, 517, 548, 586, 632]