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.

A239950 Number of partitions of n such that (number of distinct parts) = least part.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 2
6 2
7 3
8 4
9 4
10 6
11 6
12 9
13 8
14 14
15 11
16 19
17 18
18 25
19 24
20 37
21 31
22 50
23 46
24 61
25 64
26 86
27 79
28 112
29 115
30 136
31 149
32 190
33 184
34 239
35 255
36 293
37 329
38 382
39 408
40 489
41 531
42 595
43 675
44 772
45 827
46 952
47 1066
48 1176
49 1320
50 1468
51 1627
52 1827
53 2030
54 2219
55 2493
56 2769
57 3053

List of values

[0, 1, 1, 1, 1, 2, 2, 3, 4, 4, 6, 6, 9, 8, 14, 11, 19, 18, 25, 24, 37, 31, 50, 46, 61, 64, 86, 79, 112, 115, 136, 149, 190, 184, 239, 255, 293, 329, 382, 408, 489, 531, 595, 675, 772, 827, 952, 1066, 1176, 1320, 1468, 1627, 1827, 2030, 2219, 2493, 2769, 3053]