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.

A370594 Number of integer partitions of n such that only one set can be obtained by choosing a different prime factor of each part.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 2
6 0
7 3
8 3
9 4
10 3
11 4
12 5
13 5
14 8
15 10
16 11
17 7
18 14
19 13
20 19
21 23
22 24
23 20
24 30
25 33
26 40
27 47
28 49
29 55
30 53
31 72
32 80
33 90
34 92
35 110
36 110
37 132
38 154
39 169
40 180
41 201
42 218
43 246
44 281
45 302
46 323
47 348
48 396
49 433
50 482
51 530
52 584
53 618
54 670
55 754
56 823
57 903
58 980
59 1047
60 1137

List of values

[1, 0, 1, 1, 1, 2, 0, 3, 3, 4, 3, 4, 5, 5, 8, 10, 11, 7, 14, 13, 19, 23, 24, 20, 30, 33, 40, 47, 49, 55, 53, 72, 80, 90, 92, 110, 110, 132, 154, 169, 180, 201, 218, 246, 281, 302, 323, 348, 396, 433, 482, 530, 584, 618, 670, 754, 823, 903, 980, 1047, 1137]