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.

A240078 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 2
5 2
6 4
7 3
8 6
9 6
10 10
11 9
12 18
13 16
14 27
15 29
16 44
17 46
18 71
19 75
20 109
21 122
22 167
23 188
24 257
25 290
26 382
27 442
28 569
29 657
30 840
31 971
32 1220
33 1423
34 1761
35 2054
36 2528
37 2944
38 3586
39 4189
40 5061
41 5901
42 7095
43 8262
44 9869
45 11496
46 13652
47 15875
48 18786
49 21805
50 25685
51 29790

List of values

[1, 1, 1, 2, 2, 2, 4, 3, 6, 6, 10, 9, 18, 16, 27, 29, 44, 46, 71, 75, 109, 122, 167, 188, 257, 290, 382, 442, 569, 657, 840, 971, 1220, 1423, 1761, 2054, 2528, 2944, 3586, 4189, 5061, 5901, 7095, 8262, 9869, 11496, 13652, 15875, 18786, 21805, 25685, 29790]