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.

A240076 Number of partitions of n such that m(greatest part) < m(1), where m = multiplicity.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 2
6 3
7 6
8 8
9 13
10 18
11 27
12 35
13 52
14 67
15 93
16 121
17 164
18 209
19 279
20 353
21 461
22 582
23 748
24 935
25 1191
26 1480
27 1861
28 2302
29 2870
30 3526
31 4365
32 5335
33 6554
34 7976
35 9736
36 11789
37 14316
38 17259
39 20844
40 25032
41 30092
42 35992
43 43086
44 51347
45 61215
46 72710
47 86361
48 102235

List of values

[0, 0, 0, 0, 1, 2, 3, 6, 8, 13, 18, 27, 35, 52, 67, 93, 121, 164, 209, 279, 353, 461, 582, 748, 935, 1191, 1480, 1861, 2302, 2870, 3526, 4365, 5335, 6554, 7976, 9736, 11789, 14316, 17259, 20844, 25032, 30092, 35992, 43086, 51347, 61215, 72710, 86361, 102235]