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.

A219483 Number of representations of n as a sum of distinct elements of the generalized Fibonacci sequence beginning 2, 7, 9, 16, 25, 41, ....

Table of values

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

List of values

[1, 0, 1, 0, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 1, 0, 3, 0, 2, 0, 0, 0, 0, 2, 0, 3, 0, 1, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 2, 0, 4, 0, 2, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 1, 0, 4, 0, 3, 0, 0, 0, 0, 3, 0, 5, 0, 2, 0, 0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 2, 0, 5, 0, 3, 0, 0, 0, 0, 3, 0, 4, 0, 1, 0, 0]