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.

A050029 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) = 2.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 4
6 7
7 9
8 10
9 11
10 21
11 30
12 37
13 41
14 44
15 46
16 47
17 48
18 95
19 141
20 185
21 226
22 263
23 293
24 314
25 325
26 335
27 344
28 351
29 355
30 358
31 360
32 361
33 362
34 723
35 1083
36 1441
37 1796
38 2147
39 2491
40 2826
41 3151
42 3465
43 3758
44 4021
45 4247
46 4432
47 4573
48 4668
49 4716

List of values

[1, 1, 2, 3, 4, 7, 9, 10, 11, 21, 30, 37, 41, 44, 46, 47, 48, 95, 141, 185, 226, 263, 293, 314, 325, 335, 344, 351, 355, 358, 360, 361, 362, 723, 1083, 1441, 1796, 2147, 2491, 2826, 3151, 3465, 3758, 4021, 4247, 4432, 4573, 4668, 4716]