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.

A050034 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) = a(2) = 1 and a(3) = 3.

Table of values

n a(n)
1 1
2 1
3 3
4 4
5 5
6 6
7 7
8 10
9 14
10 15
11 16
12 19
13 23
14 28
15 34
16 41
17 51
18 52
19 53
20 56
21 60
22 65
23 71
24 78
25 88
26 102
27 117
28 133
29 152
30 175
31 203
32 237
33 278
34 279
35 280
36 283
37 287
38 292
39 298
40 305
41 315
42 329
43 344
44 360
45 379
46 402
47 430
48 464

List of values

[1, 1, 3, 4, 5, 6, 7, 10, 14, 15, 16, 19, 23, 28, 34, 41, 51, 52, 53, 56, 60, 65, 71, 78, 88, 102, 117, 133, 152, 175, 203, 237, 278, 279, 280, 283, 287, 292, 298, 305, 315, 329, 344, 360, 379, 402, 430, 464]