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.

A049949 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) = 1, a(2) = 2, and a(3) = 1.

Table of values

n a(n)
1 1
2 2
3 1
4 6
5 11
6 27
7 49
8 99
9 197
10 492
11 934
12 1846
13 3676
14 7347
15 14689
16 29379
17 58757
18 146892
19 279094
20 550846
21 1098021
22 2194212
23 4387512
24 8774582
25 17548869
26 35097640
27 70195230
28 140390438
29 280780860
30 561561715
31 1123123425
32 2246246851

List of values

[1, 2, 1, 6, 11, 27, 49, 99, 197, 492, 934, 1846, 3676, 7347, 14689, 29379, 58757, 146892, 279094, 550846, 1098021, 2194212, 4387512, 8774582, 17548869, 35097640, 70195230, 140390438, 280780860, 561561715, 1123123425, 2246246851]