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.

A268191 The difference between the two largest distinct parts of a partition (0 if no distinct parts), summed over all partitions of n.

Table of values

n a(n)
1 0
2 0
3 1
4 3
5 8
6 14
7 27
8 42
9 67
10 101
11 149
12 210
13 301
14 416
15 565
16 770
17 1030
18 1368
19 1800
20 2357
21 3055
22 3962
23 5068
24 6485
25 8232
26 10444
27 13125
28 16506
29 20600
30 25701
31 31865
32 39483
33 48644
34 59906
35 73375
36 89846
37 109515
38 133379
39 161784
40 196078
41 236801
42 285720
43 343623
44 412866
45 494624
46 591991
47 706623
48 842625

List of values

[0, 0, 1, 3, 8, 14, 27, 42, 67, 101, 149, 210, 301, 416, 565, 770, 1030, 1368, 1800, 2357, 3055, 3962, 5068, 6485, 8232, 10444, 13125, 16506, 20600, 25701, 31865, 39483, 48644, 59906, 73375, 89846, 109515, 133379, 161784, 196078, 236801, 285720, 343623, 412866, 494624, 591991, 706623, 842625]