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.

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

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 4
6 7
7 8
8 10
9 11
10 21
11 29
12 36
13 40
14 43
15 44
16 46
17 47
18 93
19 137
20 180
21 220
22 256
23 285
24 306
25 317
26 327
27 335
28 342
29 346
30 349
31 350
32 352
33 353
34 705
35 1055
36 1404
37 1750
38 2092
39 2427
40 2754
41 3071
42 3377
43 3662
44 3918
45 4138
46 4318
47 4455
48 4548
49 4595

List of values

[1, 2, 1, 3, 4, 7, 8, 10, 11, 21, 29, 36, 40, 43, 44, 46, 47, 93, 137, 180, 220, 256, 285, 306, 317, 327, 335, 342, 346, 349, 350, 352, 353, 705, 1055, 1404, 1750, 2092, 2427, 2754, 3071, 3377, 3662, 3918, 4138, 4318, 4455, 4548, 4595]