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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 5
6 6
7 9
8 13
9 17
10 25
11 33
12 44
13 59
14 76
15 100
16 131
17 169
18 212
19 278
20 352
21 442
22 555
23 703
24 871
25 1088
26 1342
27 1664
28 2046
29 2517
30 3064
31 3758
32 4574
33 5548
34 6718
35 8119
36 9797
37 11784
38 14150
39 16935
40 20263
41 24179
42 28798
43 34237
44 40677
45 48122
46 57008
47 67291
48 79400

List of values

[1, 1, 1, 2, 3, 5, 6, 9, 13, 17, 25, 33, 44, 59, 76, 100, 131, 169, 212, 278, 352, 442, 555, 703, 871, 1088, 1342, 1664, 2046, 2517, 3064, 3758, 4574, 5548, 6718, 8119, 9797, 11784, 14150, 16935, 20263, 24179, 28798, 34237, 40677, 48122, 57008, 67291, 79400]