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.

A050069 a(n) = a(n-1) + a(m) for n >= 3, 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) = 1 and a(2) = 3.

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 8
6 15
7 19
8 22
9 23
10 45
11 64
12 79
13 87
14 94
15 98
16 101
17 102
18 203
19 301
20 395
21 482
22 561
23 625
24 670
25 693
26 715
27 734
28 749
29 757
30 764
31 768
32 771
33 772
34 1543
35 2311
36 3075
37 3832
38 4581
39 5315
40 6030
41 6723
42 7393
43 8018
44 8579
45 9061
46 9456
47 9757

List of values

[1, 3, 4, 7, 8, 15, 19, 22, 23, 45, 64, 79, 87, 94, 98, 101, 102, 203, 301, 395, 482, 561, 625, 670, 693, 715, 734, 749, 757, 764, 768, 771, 772, 1543, 2311, 3075, 3832, 4581, 5315, 6030, 6723, 7393, 8018, 8579, 9061, 9456, 9757]