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.

A219182 Maximal number of partitions of n into any number k 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 2
17 1
18 2
19 1
20 2
21 2
22 2
23 2
24 3
25 2
26 3
27 3
28 2
29 3
30 3
31 4
32 3
33 4
34 3
35 5
36 4
37 5
38 4
39 6
40 4
41 6
42 4
43 6
44 6
45 6
46 6
47 9
48 6
49 9
50 8
51 8
52 10
53 11
54 10
55 11
56 11
57 11
58 13
59 13
60 14
61 13
62 16
63 13
64 18
65 14
66 19
67 15
68 21
69 15
70 22
71 18
72 25
73 18
74 26
75 22
76 29
77 22

List of values

[1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 2, 3, 2, 3, 3, 2, 3, 3, 4, 3, 4, 3, 5, 4, 5, 4, 6, 4, 6, 4, 6, 6, 6, 6, 9, 6, 9, 8, 8, 10, 11, 10, 11, 11, 11, 13, 13, 14, 13, 16, 13, 18, 14, 19, 15, 21, 15, 22, 18, 25, 18, 26, 22, 29, 22]