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.

A116549 a(0) = 1. a(m + 2^n) = a(n) + a(m), for 0 <= m <= 2^n - 1.

Table of values

n a(n)
0 1
1 2
2 3
3 4
4 4
5 5
6 6
7 7
8 5
9 6
10 7
11 8
12 8
13 9
14 10
15 11
16 5
17 6
18 7
19 8
20 8
21 9
22 10
23 11
24 9
25 10
26 11
27 12
28 12
29 13
30 14
31 15
32 6
33 7
34 8
35 9
36 9
37 10
38 11
39 12
40 10
41 11
42 12
43 13
44 13
45 14
46 15
47 16
48 10
49 11
50 12
51 13
52 13
53 14
54 15
55 16
56 14
57 15
58 16
59 17
60 17
61 18
62 19
63 20

List of values

[1, 2, 3, 4, 4, 5, 6, 7, 5, 6, 7, 8, 8, 9, 10, 11, 5, 6, 7, 8, 8, 9, 10, 11, 9, 10, 11, 12, 12, 13, 14, 15, 6, 7, 8, 9, 9, 10, 11, 12, 10, 11, 12, 13, 13, 14, 15, 16, 10, 11, 12, 13, 13, 14, 15, 16, 14, 15, 16, 17, 17, 18, 19, 20]