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.

A240305 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 0
2 0
3 1
4 1
5 2
6 3
7 5
8 7
9 12
10 14
11 21
12 29
13 38
14 50
15 70
16 90
17 117
18 156
19 196
20 253
21 324
22 411
23 514
24 650
25 809
26 1015
27 1259
28 1555
29 1917
30 2365
31 2898
32 3536
33 4318
34 5248
35 6365
36 7691
37 9297
38 11180
39 13446
40 16115
41 19296
42 23019
43 27474
44 32653
45 38838
46 46002
47 54511
48 64371
49 76012

List of values

[1, 0, 0, 1, 1, 2, 3, 5, 7, 12, 14, 21, 29, 38, 50, 70, 90, 117, 156, 196, 253, 324, 411, 514, 650, 809, 1015, 1259, 1555, 1917, 2365, 2898, 3536, 4318, 5248, 6365, 7691, 9297, 11180, 13446, 16115, 19296, 23019, 27474, 32653, 38838, 46002, 54511, 64371, 76012]