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.

A050045 a(n) = 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) = 2.

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 5
6 9
7 11
8 13
9 14
10 27
11 38
12 47
13 52
14 56
15 58
16 60
17 61
18 121
19 179
20 235
21 287
22 334
23 372
24 399
25 413
26 426
27 437
28 446
29 451
30 455
31 457
32 459
33 460
34 919
35 1376
36 1831
37 2282
38 2728
39 3165
40 3591
41 4004
42 4403
43 4775
44 5109
45 5396
46 5631
47 5810
48 5931

List of values

[1, 2, 2, 4, 5, 9, 11, 13, 14, 27, 38, 47, 52, 56, 58, 60, 61, 121, 179, 235, 287, 334, 372, 399, 413, 426, 437, 446, 451, 455, 457, 459, 460, 919, 1376, 1831, 2282, 2728, 3165, 3591, 4004, 4403, 4775, 5109, 5396, 5631, 5810, 5931]