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.

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

Table of values

n a(n)
0 0
1 1
2 0
3 1
4 3
5 3
6 5
7 7
8 12
9 16
10 24
11 30
12 45
13 57
14 81
15 104
16 143
17 179
18 243
19 304
20 399
21 504
22 650
23 809
24 1039
25 1286
26 1622
27 2006
28 2508
29 3077
30 3822
31 4666
32 5747
33 6995
34 8552
35 10353
36 12603
37 15189
38 18371
39 22071
40 26570
41 31785
42 38104
43 45419
44 54213
45 64426
46 76596
47 90710

List of values

[0, 1, 0, 1, 3, 3, 5, 7, 12, 16, 24, 30, 45, 57, 81, 104, 143, 179, 243, 304, 399, 504, 650, 809, 1039, 1286, 1622, 2006, 2508, 3077, 3822, 4666, 5747, 6995, 8552, 10353, 12603, 15189, 18371, 22071, 26570, 31785, 38104, 45419, 54213, 64426, 76596, 90710]