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.

A050066 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) = 3.

Table of values

n a(n)
1 1
2 3
3 3
4 4
5 7
6 8
7 11
8 14
9 18
10 19
11 22
12 25
13 29
14 36
15 44
16 55
17 69
18 70
19 73
20 76
21 80
22 87
23 95
24 106
25 120
26 138
27 157
28 179
29 204
30 233
31 269
32 313
33 368
34 369
35 372
36 375
37 379
38 386
39 394
40 405
41 419
42 437
43 456
44 478
45 503
46 532
47 568
48 612

List of values

[1, 3, 3, 4, 7, 8, 11, 14, 18, 19, 22, 25, 29, 36, 44, 55, 69, 70, 73, 76, 80, 87, 95, 106, 120, 138, 157, 179, 204, 233, 269, 313, 368, 369, 372, 375, 379, 386, 394, 405, 419, 437, 456, 478, 503, 532, 568, 612]