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.

A050038 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) = 4.

Table of values

n a(n)
1 1
2 1
3 4
4 5
5 6
6 7
7 8
8 12
9 17
10 18
11 19
12 23
13 28
14 34
15 41
16 49
17 61
18 62
19 63
20 67
21 72
22 78
23 85
24 93
25 105
26 122
27 140
28 159
29 182
30 210
31 244
32 285
33 334
34 335
35 336
36 340
37 345
38 351
39 358
40 366
41 378
42 395
43 413
44 432
45 455
46 483
47 517
48 558

List of values

[1, 1, 4, 5, 6, 7, 8, 12, 17, 18, 19, 23, 28, 34, 41, 49, 61, 62, 63, 67, 72, 78, 85, 93, 105, 122, 140, 159, 182, 210, 244, 285, 334, 335, 336, 340, 345, 351, 358, 366, 378, 395, 413, 432, 455, 483, 517, 558]