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.

A050046 a(n) = a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 5
6 6
7 8
8 10
9 13
10 14
11 16
12 18
13 21
14 26
15 32
16 40
17 50
18 51
19 53
20 55
21 58
22 63
23 69
24 77
25 87
26 100
27 114
28 130
29 148
30 169
31 195
32 227
33 267
34 268
35 270
36 272
37 275
38 280
39 286
40 294
41 304
42 317
43 331
44 347
45 365
46 386
47 412
48 444

List of values

[1, 2, 2, 3, 5, 6, 8, 10, 13, 14, 16, 18, 21, 26, 32, 40, 50, 51, 53, 55, 58, 63, 69, 77, 87, 100, 114, 130, 148, 169, 195, 227, 267, 268, 270, 272, 275, 280, 286, 294, 304, 317, 331, 347, 365, 386, 412, 444]