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.

A344989 Smallest number whose number of partitions into n distinct primes is n, or zero if there are no such partitions.

Table of values

n a(n)
1 2
2 16
3 26
4 33
5 55
6 59
7 0
8 0
9 124
10 159
11 233
12 227
13 276
14 0
15 372
16 480
17 0
18 0
19 0
20 752
21 0
22 920
23 0
24 1011
25 0
26 1211
27 1425
28 0
29 0
30 0
31 0
32 0
33 2050
34 2336
35 2495
36 0
37 0
38 0
39 0
40 3340
41 0
42 3712
43 0
44 0
45 4303
46 0
47 0
48 0
49 0
50 5195
51 0
52 5669
53 0
54 6163
55 6673
56 0
57 0
58 0
59 7504
60 0
61 0
62 8670
63 0
64 9304
65 9623
66 0
67 0
68 0
69 10638
70 10981
71 0
72 12062
73 0

List of values

[2, 16, 26, 33, 55, 59, 0, 0, 124, 159, 233, 227, 276, 0, 372, 480, 0, 0, 0, 752, 0, 920, 0, 1011, 0, 1211, 1425, 0, 0, 0, 0, 0, 2050, 2336, 2495, 0, 0, 0, 0, 3340, 0, 3712, 0, 0, 4303, 0, 0, 0, 0, 5195, 0, 5669, 0, 6163, 6673, 0, 0, 0, 7504, 0, 0, 8670, 0, 9304, 9623, 0, 0, 0, 10638, 10981, 0, 12062, 0]