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.

A000121 Number of representations of n as a sum of Fibonacci numbers (1 is allowed twice as a part).

Table of values

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

List of values

[1, 2, 2, 3, 3, 3, 4, 3, 4, 5, 4, 5, 4, 4, 6, 5, 6, 6, 5, 6, 4, 5, 7, 6, 8, 7, 6, 8, 6, 7, 8, 6, 7, 5, 5, 8, 7, 9, 9, 8, 10, 7, 8, 10, 8, 10, 8, 7, 10, 8, 9, 9, 7, 8, 5, 6, 9, 8, 11, 10, 9, 12, 9, 11, 13, 10, 12, 9, 8, 12, 10, 12, 12, 10, 12, 8, 9, 12, 10, 13, 11, 9, 12, 9, 10, 11, 8, 9, 6, 6, 10, 9]