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.

A240312 Number of partitions p of n such that (maximal multiplicity of the parts of p) = (maximal part of p).

Table of values

n a(n)
0 1
1 1
2 0
3 0
4 2
5 1
6 2
7 0
8 2
9 3
10 5
11 5
12 9
13 7
14 11
15 11
16 18
17 15
18 28
19 27
20 41
21 43
22 62
23 64
24 91
25 96
26 127
27 140
28 184
29 200
30 260
31 287
32 365
33 410
34 511
35 573
36 717
37 803
38 985
39 1120
40 1359
41 1538
42 1859
43 2106
44 2522
45 2870
46 3407
47 3872
48 4586
49 5207
50 6128
51 6976
52 8167
53 9284
54 10844
55 12321

List of values

[1, 1, 0, 0, 2, 1, 2, 0, 2, 3, 5, 5, 9, 7, 11, 11, 18, 15, 28, 27, 41, 43, 62, 64, 91, 96, 127, 140, 184, 200, 260, 287, 365, 410, 511, 573, 717, 803, 985, 1120, 1359, 1538, 1859, 2106, 2522, 2870, 3407, 3872, 4586, 5207, 6128, 6976, 8167, 9284, 10844, 12321]