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.

A104450 Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 3, 2, 5, 7, 12, 19, 31, 50, ....

Table of values

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

List of values

[1, 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 0, 3, 0, 2, 2, 0, 3, 0, 3, 1, 2, 3, 0, 4, 0, 3, 2, 1, 3, 0, 4, 0, 3, 3, 0, 5, 0, 4, 2, 2, 4, 0, 5, 0, 3, 3, 0, 4, 0, 4, 1, 3, 4, 0, 6, 0, 5, 3, 2, 5, 0, 6, 0, 4, 4, 0, 6, 0, 5, 2, 3, 5, 0, 6, 0, 4, 3, 1, 4, 0, 5, 0, 4, 4, 0, 7, 0, 6, 3, 3, 6, 0, 8, 0, 5, 5, 0, 7, 0, 6, 2, 4, 6, 0]