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.

A381079 Number of integer partitions of n whose greatest multiplicity is equal to their sum of distinct parts.

Table of values

n a(n)
0 0
1 1
2 0
3 0
4 1
5 1
6 0
7 3
8 1
9 3
10 1
11 2
12 0
13 7
14 2
15 6
16 7
17 11
18 3
19 19
20 8
21 22
22 16
23 32
24 17
25 48
26 21
27 50
28 39
29 71
30 35
31 101
32 58
33 120
34 89
35 156
36 97
37 228
38 133
39 267
40 203
41 352
42 228
43 483
44 322
45 571
46 444
47 734
48 524
49 989
50 683
51 1160
52 942
53 1490
54 1103
55 1919
56 1438
57 2302
58 1890
59 2881
60 2243
61 3683
62 2842
63 4384
64 3703
65 5461

List of values

[0, 1, 0, 0, 1, 1, 0, 3, 1, 3, 1, 2, 0, 7, 2, 6, 7, 11, 3, 19, 8, 22, 16, 32, 17, 48, 21, 50, 39, 71, 35, 101, 58, 120, 89, 156, 97, 228, 133, 267, 203, 352, 228, 483, 322, 571, 444, 734, 524, 989, 683, 1160, 942, 1490, 1103, 1919, 1438, 2302, 1890, 2881, 2243, 3683, 2842, 4384, 3703, 5461]