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.

A363994 a(n) is the number of partitions of n whose difference multiset has no duplicates; see Comments.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 3
6 4
7 5
8 7
9 6
10 10
11 11
12 11
13 15
14 18
15 18
16 25
17 29
18 28
19 38
20 44
21 47
22 54
23 67
24 68
25 84
26 88
27 102
28 114
29 137
30 132
31 167
32 180
33 204
34 214
35 261
36 264
37 315
38 328
39 377
40 414
41 476
42 473
43 564
44 603
45 677
46 708
47 820
48 846
49 969
50 1028
51 1131
52 1214
53 1364
54 1414
55 1596
56 1701
57 1858

List of values

[1, 1, 2, 2, 3, 3, 4, 5, 7, 6, 10, 11, 11, 15, 18, 18, 25, 29, 28, 38, 44, 47, 54, 67, 68, 84, 88, 102, 114, 137, 132, 167, 180, 204, 214, 261, 264, 315, 328, 377, 414, 476, 473, 564, 603, 677, 708, 820, 846, 969, 1028, 1131, 1214, 1364, 1414, 1596, 1701, 1858]