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.

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

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 19
6 35
7 73
8 161
9 376
10 680
11 1363
12 2741
13 5536
14 11375
15 23737
16 51647
17 121495
18 219254
19 438511
20 877037
21 1754128
22 3508559
23 7018105
24 14040383
25 28098967
26 56295692
27 112908400
28 227132417
29 459528811
30 940138484
31 1965086401
32 4276793213
33 10059144016
34 18153201632
35 36306403267

List of values

[1, 2, 4, 8, 19, 35, 73, 161, 376, 680, 1363, 2741, 5536, 11375, 23737, 51647, 121495, 219254, 438511, 877037, 1754128, 3508559, 7018105, 14040383, 28098967, 56295692, 112908400, 227132417, 459528811, 940138484, 1965086401, 4276793213, 10059144016, 18153201632, 36306403267]