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.

A211870 Difference between sum of largest parts and sum of smallest parts of all partitions of n into an odd number of parts.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 3
6 6
7 13
8 22
9 38
10 58
11 93
12 134
13 202
14 282
15 405
16 554
17 774
18 1035
19 1412
20 1862
21 2489
22 3243
23 4267
24 5496
25 7137
26 9106
27 11684
28 14782
29 18782
30 23575
31 29689
32 37010
33 46238
34 57275
35 71048
36 87489
37 107844
38 132083
39 161853
40 197243
41 240418
42 291619
43 353702
44 427167

List of values

[0, 0, 0, 0, 1, 3, 6, 13, 22, 38, 58, 93, 134, 202, 282, 405, 554, 774, 1035, 1412, 1862, 2489, 3243, 4267, 5496, 7137, 9106, 11684, 14782, 18782, 23575, 29689, 37010, 46238, 57275, 71048, 87489, 107844, 132083, 161853, 197243, 240418, 291619, 353702, 427167]