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.

A092310 Sum of largest parts (counted with multiplicity) of all partitions of n into odd parts.

Table of values

n a(n)
1 1
2 2
3 6
4 7
5 13
6 20
7 28
8 34
9 53
10 71
11 88
12 117
13 148
14 188
15 250
16 301
17 365
18 472
19 565
20 688
21 860
22 1027
23 1224
24 1486
25 1771
26 2107
27 2524
28 2983
29 3496
30 4158
31 4867
32 5666
33 6676
34 7762
35 9021
36 10525
37 12145
38 14034
39 16249
40 18696
41 21478
42 24721
43 28308
44 32364
45 37110
46 42289

List of values

[1, 2, 6, 7, 13, 20, 28, 34, 53, 71, 88, 117, 148, 188, 250, 301, 365, 472, 565, 688, 860, 1027, 1224, 1486, 1771, 2107, 2524, 2983, 3496, 4158, 4867, 5666, 6676, 7762, 9021, 10525, 12145, 14034, 16249, 18696, 21478, 24721, 28308, 32364, 37110, 42289]