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.

A240304 Number of partitions of n such that (maximal multiplicity of parts) > (multiplicity of the least part).

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 1
6 0
7 2
8 3
9 4
10 5
11 12
12 11
13 21
14 27
15 37
16 49
17 71
18 87
19 124
20 153
21 204
22 260
23 344
24 421
25 550
26 685
27 867
28 1076
29 1360
30 1660
31 2081
32 2544
33 3145
34 3831
35 4706
36 5692
37 6958
38 8395
39 10171
40 12224
41 14761
42 17645
43 21204
44 25281
45 30207
46 35914
47 42760
48 50618
49 60057
50 70914

List of values

[0, 0, 0, 0, 0, 1, 0, 2, 3, 4, 5, 12, 11, 21, 27, 37, 49, 71, 87, 124, 153, 204, 260, 344, 421, 550, 685, 867, 1076, 1360, 1660, 2081, 2544, 3145, 3831, 4706, 5692, 6958, 8395, 10171, 12224, 14761, 17645, 21204, 25281, 30207, 35914, 42760, 50618, 60057, 70914]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.