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.

A220486 a(n) = n(p(n)-d(n)): sum of all of parts of all partitions of n with at least one distinct part.

Table of values

n a(n)
1 0
2 0
3 3
4 8
5 25
6 42
7 91
8 144
9 243
10 380
11 594
12 852
13 1287
14 1834
15 2580
16 3616
17 5015
18 6822
19 9272
20 12420
21 16548
22 21956
23 28819
24 37608
25 48875
26 63232
27 81162
28 103936
29 132327
30 167880
31 212040
32 266976
33 334587
34 418404
35 520765
36 646848
37 800495
38 988418
39 1216059
40 1493200

List of values

[0, 0, 3, 8, 25, 42, 91, 144, 243, 380, 594, 852, 1287, 1834, 2580, 3616, 5015, 6822, 9272, 12420, 16548, 21956, 28819, 37608, 48875, 63232, 81162, 103936, 132327, 167880, 212040, 266976, 334587, 418404, 520765, 646848, 800495, 988418, 1216059, 1493200]