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.

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

Table of values

n a(n)
1 1
2 1
3 2
4 5
5 14
6 24
7 52
8 123
9 345
10 568
11 1140
12 2299
13 4697
14 9839
15 21409
16 50358
17 141235
18 232113
19 464230
20 928479
21 1857057
22 3714559
23 7430849
24 14869238
25 29778995
26 59739745
27 120175856
28 243137792
29 497430263
30 1039731033
31 2262860113

List of values

[1, 1, 2, 5, 14, 24, 52, 123, 345, 568, 1140, 2299, 4697, 9839, 21409, 50358, 141235, 232113, 464230, 928479, 1857057, 3714559, 7430849, 14869238, 29778995, 59739745, 120175856, 243137792, 497430263, 1039731033, 2262860113]