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.

A372632 Sum over all partitions of n of the number of elements with minimal multiplicity in their partition.

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 6
5 9
6 16
7 21
8 33
9 47
10 67
11 90
12 134
13 172
14 242
15 321
16 434
17 558
18 761
19 961
20 1279
21 1627
22 2112
23 2657
24 3452
25 4292
26 5481
27 6824
28 8619
29 10634
30 13381
31 16389
32 20425
33 24989
34 30864
35 37556
36 46221
37 55912
38 68337
39 82510
40 100262
41 120476
42 145855
43 174562
44 210272
45 251065

List of values

[0, 1, 2, 4, 6, 9, 16, 21, 33, 47, 67, 90, 134, 172, 242, 321, 434, 558, 761, 961, 1279, 1627, 2112, 2657, 3452, 4292, 5481, 6824, 8619, 10634, 13381, 16389, 20425, 24989, 30864, 37556, 46221, 55912, 68337, 82510, 100262, 120476, 145855, 174562, 210272, 251065]