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.

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

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 4
5 5
6 8
7 11
8 17
9 23
10 33
11 43
12 61
13 79
14 108
15 140
16 187
17 238
18 314
19 397
20 513
21 648
22 826
23 1032
24 1307
25 1622
26 2029
27 2508
28 3113
29 3821
30 4713
31 5754
32 7048
33 8569
34 10431
35 12618
36 15290
37 18413
38 22193
39 26628
40 31954
41 38184
42 45639
43 54340
44 64694
45 76780
46 91077
47 107732

List of values

[0, 1, 1, 2, 4, 5, 8, 11, 17, 23, 33, 43, 61, 79, 108, 140, 187, 238, 314, 397, 513, 648, 826, 1032, 1307, 1622, 2029, 2508, 3113, 3821, 4713, 5754, 7048, 8569, 10431, 12618, 15290, 18413, 22193, 26628, 31954, 38184, 45639, 54340, 64694, 76780, 91077, 107732]