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.

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

Table of values

n a(n)
1 1
2 3
3 4
4 5
5 9
6 10
7 14
8 23
9 37
10 38
11 42
12 51
13 65
14 102
15 144
16 209
17 353
18 354
19 358
20 367
21 381
22 418
23 460
24 525
25 669
26 1022
27 1380
28 1761
29 2221
30 2890
31 4270
32 6491
33 10761
34 10762
35 10766
36 10775
37 10789
38 10826
39 10868
40 10933
41 11077
42 11430
43 11788

List of values

[1, 3, 4, 5, 9, 10, 14, 23, 37, 38, 42, 51, 65, 102, 144, 209, 353, 354, 358, 367, 381, 418, 460, 525, 669, 1022, 1380, 1761, 2221, 2890, 4270, 6491, 10761, 10762, 10766, 10775, 10789, 10826, 10868, 10933, 11077, 11430, 11788]