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.

A050033 a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n 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 9
7 12
8 13
9 14
10 27
11 39
12 48
13 53
14 57
15 60
16 61
17 62
18 123
19 183
20 240
21 293
22 341
23 380
24 407
25 421
26 434
27 446
28 455
29 460
30 464
31 467
32 468
33 469
34 937
35 1404
36 1868
37 2328
38 2783
39 3229
40 3663
41 4084
42 4491
43 4871
44 5212
45 5505
46 5745
47 5928
48 6051

List of values

[1, 1, 3, 4, 5, 9, 12, 13, 14, 27, 39, 48, 53, 57, 60, 61, 62, 123, 183, 240, 293, 341, 380, 407, 421, 434, 446, 455, 460, 464, 467, 468, 469, 937, 1404, 1868, 2328, 2783, 3229, 3663, 4084, 4491, 4871, 5212, 5505, 5745, 5928, 6051]