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.

A240183 Number of partitions of n such that (greatest part) = (multiplicity of least part).

Table of values

n a(n)
0 0
1 1
2 0
3 0
4 2
5 0
6 2
7 0
8 3
9 3
10 4
11 2
12 9
13 3
14 10
15 10
16 17
17 11
18 26
19 19
20 36
21 33
22 48
23 47
24 79
25 71
26 101
27 109
28 149
29 151
30 215
31 216
32 293
33 318
34 404
35 443
36 575
37 611
38 773
39 864
40 1068
41 1175
42 1458
43 1609
44 1964
45 2210
46 2642
47 2970
48 3577
49 3995
50 4753
51 5369
52 6332
53 7138
54 8414
55 9476

List of values

[0, 1, 0, 0, 2, 0, 2, 0, 3, 3, 4, 2, 9, 3, 10, 10, 17, 11, 26, 19, 36, 33, 48, 47, 79, 71, 101, 109, 149, 151, 215, 216, 293, 318, 404, 443, 575, 611, 773, 864, 1068, 1175, 1458, 1609, 1964, 2210, 2642, 2970, 3577, 3995, 4753, 5369, 6332, 7138, 8414, 9476]