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.

A240313 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 1
3 1
4 3
5 3
6 5
7 5
8 8
9 11
10 15
11 19
12 27
13 32
14 43
15 53
16 70
17 84
18 112
19 135
20 174
21 212
22 268
23 324
24 407
25 490
26 606
27 731
28 897
29 1075
30 1312
31 1567
32 1899
33 2265
34 2726
35 3238
36 3886
37 4598
38 5486
39 6482
40 7698
41 9063
42 10727
43 12592
44 14846
45 17391
46 20427
47 23862
48 27952
49 32568
50 38033

List of values

[1, 1, 1, 1, 3, 3, 5, 5, 8, 11, 15, 19, 27, 32, 43, 53, 70, 84, 112, 135, 174, 212, 268, 324, 407, 490, 606, 731, 897, 1075, 1312, 1567, 1899, 2265, 2726, 3238, 3886, 4598, 5486, 6482, 7698, 9063, 10727, 12592, 14846, 17391, 20427, 23862, 27952, 32568, 38033]