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.

A003263 Number of representations of n as a sum of distinct Lucas numbers 1, 3, 4, 7, 11, ... (A000204).

Table of values

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

List of values

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