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.

A294204 Number of partitions of n into distinct Lucas parts (A000032) greater than 1.

Table of values

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

List of values

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