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.

A092316 Sum of largest parts of all partitions of n into odd distinct parts.

Table of values

n a(n)
1 1
2 0
3 3
4 3
5 5
6 5
7 7
8 12
9 14
10 16
11 18
12 27
13 29
14 33
15 42
16 55
17 59
18 65
19 78
20 95
21 110
22 118
23 137
24 167
25 188
26 200
27 236
28 274
29 303
30 330
31 376
32 435
33 485
34 522
35 591
36 677
37 741
38 803
39 903
40 1022
41 1115
42 1210
43 1345
44 1505
45 1650
46 1784
47 1964
48 2201
49 2393
50 2578
51 2843
52 3143
53 3409
54 3685
55 4034

List of values

[1, 0, 3, 3, 5, 5, 7, 12, 14, 16, 18, 27, 29, 33, 42, 55, 59, 65, 78, 95, 110, 118, 137, 167, 188, 200, 236, 274, 303, 330, 376, 435, 485, 522, 591, 677, 741, 803, 903, 1022, 1115, 1210, 1345, 1505, 1650, 1784, 1964, 2201, 2393, 2578, 2843, 3143, 3409, 3685, 4034]