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.

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

Table of values

n a(n)
1 1
2 3
3 4
4 11
5 20
6 50
7 93
8 185
9 368
10 920
11 1748
12 3453
13 6876
14 13743
15 27479
16 54957
17 109912
18 274780
19 522082
20 1030428
21 2053989
22 4104555
23 8207405
24 16413982
25 32827412
26 65654641
27 131309190
28 262618337
29 525236644
30 1050473279
31 2100946551
32 4201893101
33 8403786200
34 21009465500
35 39917984450

List of values

[1, 3, 4, 11, 20, 50, 93, 185, 368, 920, 1748, 3453, 6876, 13743, 27479, 54957, 109912, 274780, 522082, 1030428, 2053989, 4104555, 8207405, 16413982, 32827412, 65654641, 131309190, 262618337, 525236644, 1050473279, 2100946551, 4201893101, 8403786200, 21009465500, 39917984450]