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.

A219181 Number of partitions of n into the maximal possible number of distinct prime parts or 0 if there are no such partitions.

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 2, 1, 2, 1, 3, 1, 3, 2, 4, 2, 4, 2, 5, 2, 1, 4, 1, 4, 1, 4, 1, 6, 2, 6, 1, 6, 2, 8, 4, 10, 2, 1, 5, 1, 6, 1, 5, 2, 6, 2, 10, 1, 9, 1, 11, 4, 15, 3, 14, 3, 1, 6, 1, 6, 1, 5, 1, 10, 1, 11]