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.

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

Table of values

n a(n)
1 1
2 1
3 4
4 7
5 14
6 28
7 56
8 115
9 233
10 460
11 920
12 1843
13 3689
14 7385
15 14784
16 29596
17 59251
18 118388
19 236776
20 473555
21 947113
22 1894233
23 3788480
24 7576988
25 15154035
26 30308188
27 60616603
28 121233666
29 242468255
30 484938356
31 969880408
32 1939768215

List of values

[1, 1, 4, 7, 14, 28, 56, 115, 233, 460, 920, 1843, 3689, 7385, 14784, 29596, 59251, 118388, 236776, 473555, 947113, 1894233, 3788480, 7576988, 15154035, 30308188, 60616603, 121233666, 242468255, 484938356, 969880408, 1939768215]