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.

A050060 a(n) = a(n-1) + a(m) for n >= 4, 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, a(2) = 3, and a(3) = 2.

Table of values

n a(n)
1 1
2 3
3 2
4 3
5 5
6 6
7 8
8 13
9 21
10 22
11 24
12 29
13 37
14 58
15 82
16 119
17 201
18 202
19 204
20 209
21 217
22 238
23 262
24 299
25 381
26 582
27 786
28 1003
29 1265
30 1646
31 2432
32 3697
33 6129
34 6130
35 6132
36 6137
37 6145
38 6166
39 6190
40 6227
41 6309
42 6510
43 6714
44 6931
45 7193
46 7574
47 8360

List of values

[1, 3, 2, 3, 5, 6, 8, 13, 21, 22, 24, 29, 37, 58, 82, 119, 201, 202, 204, 209, 217, 238, 262, 299, 381, 582, 786, 1003, 1265, 1646, 2432, 3697, 6129, 6130, 6132, 6137, 6145, 6166, 6190, 6227, 6309, 6510, 6714, 6931, 7193, 7574, 8360]