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.

A294203 Number of partitions of n into distinct Lucas parts (A000204) greater than 1.

Table of values

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

List of values

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