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.

A240077 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 1
3 2
4 3
5 4
6 7
7 9
8 14
9 19
10 28
11 36
12 53
13 68
14 94
15 122
16 165
17 210
18 280
19 354
20 462
21 583
22 749
23 936
24 1192
25 1481
26 1862
27 2303
28 2871
29 3527
30 4366
31 5336
32 6555
33 7977
34 9737
35 11790
36 14317
37 17260
38 20845
39 25033
40 30093
41 35993
42 43087
43 51348
44 61216
45 72711
46 86362
47 102236

List of values

[1, 1, 1, 2, 3, 4, 7, 9, 14, 19, 28, 36, 53, 68, 94, 122, 165, 210, 280, 354, 462, 583, 749, 936, 1192, 1481, 1862, 2303, 2871, 3527, 4366, 5336, 6555, 7977, 9737, 11790, 14317, 17260, 20845, 25033, 30093, 35993, 43087, 51348, 61216, 72711, 86362, 102236]