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.

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

Table of values

n a(n)
1 1
2 3
3 3
4 10
5 18
6 45
7 83
8 166
9 330
10 825
11 1567
12 3096
13 6165
14 12322
15 24637
16 49274
17 98546
18 246365
19 468093
20 923871
21 1841585
22 3680101
23 7358673
24 14716604
25 29432713
26 58865262
27 117730441
28 235460844
29 470921661
30 941843314
31 1883686621

List of values

[1, 3, 3, 10, 18, 45, 83, 166, 330, 825, 1567, 3096, 6165, 12322, 24637, 49274, 98546, 246365, 468093, 923871, 1841585, 3680101, 7358673, 14716604, 29432713, 58865262, 117730441, 235460844, 470921661, 941843314, 1883686621]