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.

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

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 17
6 33
7 67
8 136
9 276
10 545
11 1091
12 2184
13 4372
14 8753
15 17522
16 35078
17 70225
18 140315
19 280631
20 561264
21 1122532
22 2245073
23 4490162
24 8980358
25 17960785
26 35921710
27 71843689
28 143687924
29 287376941
30 574756070
31 1149516521
32 2299041811

List of values

[1, 2, 4, 8, 17, 33, 67, 136, 276, 545, 1091, 2184, 4372, 8753, 17522, 35078, 70225, 140315, 280631, 561264, 1122532, 2245073, 4490162, 8980358, 17960785, 35921710, 71843689, 143687924, 287376941, 574756070, 1149516521, 2299041811]