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.

A356874 Write n as Sum_{i in S} 2^(i-1), where S is a set of positive integers, then a(n) = Sum_{i in S} F_i, where F_i is the i-th Fibonacci number, A000045(i).

Table of values

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

List of values

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