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.

A050043 a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) 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 6
6 8
7 11
8 19
9 38
10 40
11 43
12 51
13 70
14 110
15 161
16 271
17 542
18 544
19 547
20 555
21 574
22 614
23 665
24 775
25 1046
26 1590
27 2145
28 2759
29 3534
30 5124
31 7883
32 13007
33 26014
34 26016
35 26019
36 26027
37 26046
38 26086
39 26137
40 26247
41 26518
42 27062
43 27617

List of values

[1, 2, 1, 3, 6, 8, 11, 19, 38, 40, 43, 51, 70, 110, 161, 271, 542, 544, 547, 555, 574, 614, 665, 775, 1046, 1590, 2145, 2759, 3534, 5124, 7883, 13007, 26014, 26016, 26019, 26027, 26046, 26086, 26137, 26247, 26518, 27062, 27617]