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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 3
6 5
7 6
8 7
9 8
10 15
11 21
12 26
13 29
14 31
15 32
16 33
17 34
18 67
19 99
20 130
21 159
22 185
23 206
24 221
25 229
26 236
27 242
28 247
29 250
30 252
31 253
32 254
33 255
34 509
35 762
36 1014
37 1264
38 1511
39 1753
40 1989
41 2218
42 2439
43 2645
44 2830
45 2989
46 3119
47 3218
48 3285
49 3319

List of values

[1, 1, 1, 2, 3, 5, 6, 7, 8, 15, 21, 26, 29, 31, 32, 33, 34, 67, 99, 130, 159, 185, 206, 221, 229, 236, 242, 247, 250, 252, 253, 254, 255, 509, 762, 1014, 1264, 1511, 1753, 1989, 2218, 2439, 2645, 2830, 2989, 3119, 3218, 3285, 3319]