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.

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

Table of values

n a(n)
1 1
2 1
3 3
4 4
5 7
6 8
7 11
8 18
9 29
10 30
11 33
12 40
13 51
14 80
15 113
16 164
17 277
18 278
19 281
20 288
21 299
22 328
23 361
24 412
25 525
26 802
27 1083
28 1382
29 1743
30 2268
31 3351
32 5094
33 8445
34 8446
35 8449
36 8456
37 8467
38 8496
39 8529
40 8580
41 8693
42 8970
43 9251
44 9550
45 9911
46 10436

List of values

[1, 1, 3, 4, 7, 8, 11, 18, 29, 30, 33, 40, 51, 80, 113, 164, 277, 278, 281, 288, 299, 328, 361, 412, 525, 802, 1083, 1382, 1743, 2268, 3351, 5094, 8445, 8446, 8449, 8456, 8467, 8496, 8529, 8580, 8693, 8970, 9251, 9550, 9911, 10436]