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.

A239966 Number of partitions of n such that (number of distinct parts) = minimal multiplicity of the parts.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 1
6 2
7 2
8 4
9 3
10 6
11 5
12 8
13 6
14 13
15 6
16 15
17 10
18 19
19 12
20 24
21 15
22 33
23 22
24 38
25 28
26 52
27 39
28 61
29 51
30 78
31 66
32 94
33 85
34 118
35 103
36 140
37 130
38 168
39 165
40 194
41 190
42 244
43 230
44 274
45 285
46 328
47 327
48 394
49 386
50 449
51 485
52 522
53 540
54 646
55 639
56 712
57 790
58 846
59 880
60 1025

List of values

[0, 1, 1, 1, 1, 1, 2, 2, 4, 3, 6, 5, 8, 6, 13, 6, 15, 10, 19, 12, 24, 15, 33, 22, 38, 28, 52, 39, 61, 51, 78, 66, 94, 85, 118, 103, 140, 130, 168, 165, 194, 190, 244, 230, 274, 285, 328, 327, 394, 386, 449, 485, 522, 540, 646, 639, 712, 790, 846, 880, 1025]