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.

A067595 Number of partitions of n into distinct Lucas parts (A000032).

Table of values

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

List of values

[1, 1, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 5, 4, 4, 4, 5, 3, 3, 4, 4, 4, 4, 6, 5, 5, 5, 6, 4, 4, 6, 5, 5, 5, 6, 4, 4, 4, 5, 4, 4, 7, 6, 6, 6, 8, 5, 5, 7, 6, 6, 6, 8, 6, 6, 6, 7, 5, 5, 8, 6, 6, 6, 7, 4, 4, 5, 5, 5, 5, 8, 7, 7, 7, 9, 6, 6, 9, 8, 8, 8, 10, 7, 7, 7, 8, 6, 6, 10, 8, 8, 8, 10, 6, 6, 8]