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.

A092265 Sum of smallest parts of all partitions of n into distinct parts.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 8
6 10
7 14
8 16
9 23
10 26
11 34
12 40
13 50
14 58
15 74
16 83
17 102
18 120
19 142
20 164
21 198
22 226
23 266
24 308
25 359
26 412
27 482
28 548
29 634
30 730
31 834
32 950
33 1094
34 1240
35 1416
36 1609
37 1826
38 2068
39 2350
40 2648
41 2994
42 3382
43 3806
44 4280
45 4826
46 5408
47 6070
48 6806
49 7619
50 8522
51 9534
52 10632

List of values

[1, 2, 4, 5, 8, 10, 14, 16, 23, 26, 34, 40, 50, 58, 74, 83, 102, 120, 142, 164, 198, 226, 266, 308, 359, 412, 482, 548, 634, 730, 834, 950, 1094, 1240, 1416, 1609, 1826, 2068, 2350, 2648, 2994, 3382, 3806, 4280, 4826, 5408, 6070, 6806, 7619, 8522, 9534, 10632]