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.

A121549 Number of ordered ways of writing n as a sum of two Fibonacci numbers (only one 1 is considered as a Fibonacci number).

Table of values

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

List of values

[0, 1, 2, 3, 2, 3, 2, 2, 2, 3, 2, 0, 2, 2, 2, 3, 0, 2, 0, 0, 2, 2, 2, 2, 0, 3, 0, 0, 2, 0, 0, 0, 0, 2, 2, 2, 2, 0, 2, 0, 0, 3, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0]