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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 5
6 8
7 9
8 14
9 17
10 24
11 29
12 42
13 49
14 68
15 83
16 110
17 133
18 176
19 211
20 274
21 331
22 420
23 507
24 640
25 767
26 956
27 1149
28 1416
29 1695
30 2078
31 2477
32 3014
33 3589
34 4334
35 5147
36 6188
37 7321
38 8756
39 10341
40 12306
41 14491
42 17182
43 20175
44 23828
45 27919
46 32848
47 38393
48 45038
49 52505

List of values

[1, 1, 2, 3, 4, 5, 8, 9, 14, 17, 24, 29, 42, 49, 68, 83, 110, 133, 176, 211, 274, 331, 420, 507, 640, 767, 956, 1149, 1416, 1695, 2078, 2477, 3014, 3589, 4334, 5147, 6188, 7321, 8756, 10341, 12306, 14491, 17182, 20175, 23828, 27919, 32848, 38393, 45038, 52505]