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.

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

Table of values

n a(n)
1 1
2 1
3 4
4 5
5 10
6 11
7 16
8 27
9 54
10 55
11 60
12 71
13 98
14 153
15 224
16 377
17 754
18 755
19 760
20 771
21 798
22 853
23 924
24 1077
25 1454
26 2209
27 2980
28 3833
29 4910
30 7119
31 10952
32 18071
33 36142
34 36143
35 36148
36 36159
37 36186
38 36241
39 36312
40 36465
41 36842
42 37597
43 38368

List of values

[1, 1, 4, 5, 10, 11, 16, 27, 54, 55, 60, 71, 98, 153, 224, 377, 754, 755, 760, 771, 798, 853, 924, 1077, 1454, 2209, 2980, 3833, 4910, 7119, 10952, 18071, 36142, 36143, 36148, 36159, 36186, 36241, 36312, 36465, 36842, 37597, 38368]