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.

A240311 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 2
4 4
5 5
6 8
7 10
8 16
9 22
10 32
11 42
12 59
13 76
14 103
15 134
16 179
17 228
18 301
19 382
20 494
21 623
22 796
23 995
24 1259
25 1564
26 1957
27 2419
28 3005
29 3690
30 4552
31 5562
32 6815
33 8288
34 10095
35 12218
36 14808
37 17842
38 21514
39 25823
40 30999
41 37058
42 44306
43 52775
44 62851
45 74613
46 88538
47 104764

List of values

[1, 1, 1, 2, 4, 5, 8, 10, 16, 22, 32, 42, 59, 76, 103, 134, 179, 228, 301, 382, 494, 623, 796, 995, 1259, 1564, 1957, 2419, 3005, 3690, 4552, 5562, 6815, 8288, 10095, 12218, 14808, 17842, 21514, 25823, 30999, 37058, 44306, 52775, 62851, 74613, 88538, 104764]