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.

A240309 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 0
1 0
2 1
3 1
4 2
5 2
6 5
7 6
8 9
9 13
10 17
11 23
12 33
13 42
14 59
15 76
16 100
17 128
18 173
19 212
20 275
21 350
22 447
23 552
24 704
25 870
26 1094
27 1346
28 1672
29 2048
30 2540
31 3084
32 3775
33 4595
34 5592
35 6764
36 8180
37 9853
38 11865
39 14250
40 17075
41 20404
42 24376
43 29024
44 34498
45 41012
46 48550
47 57463
48 67873

List of values

[0, 0, 1, 1, 2, 2, 5, 6, 9, 13, 17, 23, 33, 42, 59, 76, 100, 128, 173, 212, 275, 350, 447, 552, 704, 870, 1094, 1346, 1672, 2048, 2540, 3084, 3775, 4595, 5592, 6764, 8180, 9853, 11865, 14250, 17075, 20404, 24376, 29024, 34498, 41012, 48550, 57463, 67873]