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.

A364612 a(n) = number of partitions of n whose difference multiset has at least one duplicate; see Comments.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 2
5 4
6 7
7 10
8 15
9 24
10 32
11 45
12 66
13 86
14 117
15 158
16 206
17 268
18 357
19 452
20 583
21 745
22 948
23 1188
24 1507
25 1874
26 2348
27 2908
28 3604
29 4428
30 5472
31 6675
32 8169
33 9939
34 12096
35 14622
36 17713
37 21322
38 25687
39 30808
40 36924
41 44107
42 52701
43 62697
44 74572
45 88457
46 104850
47 123934

List of values

[0, 0, 0, 1, 2, 4, 7, 10, 15, 24, 32, 45, 66, 86, 117, 158, 206, 268, 357, 452, 583, 745, 948, 1188, 1507, 1874, 2348, 2908, 3604, 4428, 5472, 6675, 8169, 9939, 12096, 14622, 17713, 21322, 25687, 30808, 36924, 44107, 52701, 62697, 74572, 88457, 104850, 123934]