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.

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

Table of values

n a(n)
1 1
2 1
3 2
4 5
5 10
6 24
7 45
8 89
9 178
10 444
11 844
12 1667
13 3320
14 6635
15 13267
16 26533
17 53066
18 132664
19 252062
20 497492
21 991669
22 1981685
23 3962547
24 7924694
25 15849122
26 31698155
27 63396266
28 126792511
29 253585008
30 507170011
31 1014340019
32 2028680037
33 4057360074
34 10143400184
35 19272460350
36 38037750692

List of values

[1, 1, 2, 5, 10, 24, 45, 89, 178, 444, 844, 1667, 3320, 6635, 13267, 26533, 53066, 132664, 252062, 497492, 991669, 1981685, 3962547, 7924694, 15849122, 31698155, 63396266, 126792511, 253585008, 507170011, 1014340019, 2028680037, 4057360074, 10143400184, 19272460350, 38037750692]