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.

A240182 Number of partitions of n such that (greatest part) <= (multiplicity of least part).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 2
6 5
7 4
8 8
9 10
10 13
11 15
12 25
13 25
14 37
15 46
16 61
17 70
18 97
19 112
20 150
21 177
22 224
23 270
24 347
25 407
26 508
27 611
28 754
29 895
30 1106
31 1304
32 1594
33 1892
34 2283
35 2708
36 3262
37 3835
38 4595
39 5421
40 6452
41 7574
42 8993
43 10530
44 12445
45 14564
46 17123
47 19992
48 23465
49 27302
50 31931

List of values

[1, 1, 1, 1, 3, 2, 5, 4, 8, 10, 13, 15, 25, 25, 37, 46, 61, 70, 97, 112, 150, 177, 224, 270, 347, 407, 508, 611, 754, 895, 1106, 1304, 1594, 1892, 2283, 2708, 3262, 3835, 4595, 5421, 6452, 7574, 8993, 10530, 12445, 14564, 17123, 19992, 23465, 27302, 31931]