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.

A239964 Number of partitions of n such that (number of distinct parts) = maximal multiplicity of the parts.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 2
5 3
6 3
7 4
8 6
9 5
10 11
11 12
12 15
13 21
14 26
15 30
16 41
17 52
18 56
19 82
20 99
21 118
22 144
23 189
24 221
25 279
26 327
27 405
28 491
29 600
30 699
31 860
32 1038
33 1230
34 1470
35 1754
36 2106
37 2487
38 2970
39 3489
40 4148
41 4883
42 5779
43 6763
44 8024
45 9284
46 11006
47 12780
48 15029
49 17452
50 20405
51 23660

List of values

[0, 1, 1, 1, 2, 3, 3, 4, 6, 5, 11, 12, 15, 21, 26, 30, 41, 52, 56, 82, 99, 118, 144, 189, 221, 279, 327, 405, 491, 600, 699, 860, 1038, 1230, 1470, 1754, 2106, 2487, 2970, 3489, 4148, 4883, 5779, 6763, 8024, 9284, 11006, 12780, 15029, 17452, 20405, 23660]