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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 4
6 5
7 7
8 12
9 24
10 25
11 27
12 32
13 44
14 69
15 101
16 170
17 340
18 341
19 343
20 348
21 360
22 385
23 417
24 486
25 656
26 997
27 1345
28 1730
29 2216
30 3213
31 4943
32 8156
33 16312
34 16313
35 16315
36 16320
37 16332
38 16357
39 16389
40 16458
41 16628
42 16969
43 17317
44 17702

List of values

[1, 1, 1, 2, 4, 5, 7, 12, 24, 25, 27, 32, 44, 69, 101, 170, 340, 341, 343, 348, 360, 385, 417, 486, 656, 997, 1345, 1730, 2216, 3213, 4943, 8156, 16312, 16313, 16315, 16320, 16332, 16357, 16389, 16458, 16628, 16969, 17317, 17702]