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.

A239962 Number of partitions of n such that (number of distinct parts) = multiplicity of the least part.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 3
7 3
8 6
9 4
10 10
11 9
12 12
13 16
14 23
15 21
16 34
17 42
18 45
19 64
20 76
21 92
22 113
23 144
24 166
25 214
26 247
27 308
28 365
29 459
30 523
31 642
32 774
33 922
34 1094
35 1304
36 1556
37 1830
38 2191
39 2573
40 3039
41 3570
42 4242
43 4911
44 5859
45 6756
46 8000
47 9244
48 10916
49 12581
50 14780
51 17048
52 19894

List of values

[1, 1, 1, 1, 2, 2, 3, 3, 6, 4, 10, 9, 12, 16, 23, 21, 34, 42, 45, 64, 76, 92, 113, 144, 166, 214, 247, 308, 365, 459, 523, 642, 774, 922, 1094, 1304, 1556, 1830, 2191, 2573, 3039, 3570, 4242, 4911, 5859, 6756, 8000, 9244, 10916, 12581, 14780, 17048, 19894]