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.

A182629 Total number of largest parts in all partitions of n that contain at least two distinct parts.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 2
5 6
6 8
7 17
8 23
9 36
10 51
11 75
12 95
13 138
14 181
15 236
16 310
17 407
18 516
19 667
20 840
21 1062
22 1344
23 1678
24 2080
25 2589
26 3212
27 3942
28 4851
29 5937
30 7246
31 8824
32 10724
33 12971
34 15705
35 18895
36 22749
37 27296
38 32734
39 39083
40 46668
41 55553
42 66086
43 78389
44 92937
45 109857
46 129850

List of values

[0, 0, 0, 1, 2, 6, 8, 17, 23, 36, 51, 75, 95, 138, 181, 236, 310, 407, 516, 667, 840, 1062, 1344, 1678, 2080, 2589, 3212, 3942, 4851, 5937, 7246, 8824, 10724, 12971, 15705, 18895, 22749, 27296, 32734, 39083, 46668, 55553, 66086, 78389, 92937, 109857, 129850]