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.

A382079 Number of integer partitions of n that can be partitioned into a set of sets in exactly one way.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 3
7 4
8 6
9 5
10 10
11 9
12 13
13 14
14 21
15 20
16 32
17 31
18 42
19 47
20 63
21 62
22 90
23 94
24 117
25 138
26 170
27 186
28 235
29 260
30 315
31 363
32 429
33 493
34 588
35 674
36 795
37 901
38 1060
39 1209
40 1431
41 1608
42 1896
43 2152
44 2515
45 2854
46 3310
47 3734
48 4368
49 4905
50 5686

List of values

[1, 1, 1, 1, 2, 3, 3, 4, 6, 5, 10, 9, 13, 14, 21, 20, 32, 31, 42, 47, 63, 62, 90, 94, 117, 138, 170, 186, 235, 260, 315, 363, 429, 493, 588, 674, 795, 901, 1060, 1209, 1431, 1608, 1896, 2152, 2515, 2854, 3310, 3734, 4368, 4905, 5686]