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.

A182708 a(n) is the sum of the smallest parts of all partitions of n that do not contain 1 as a part.

Table of values

n a(n)
1 0
2 2
3 3
4 6
5 7
6 13
7 14
8 23
9 27
10 39
11 45
12 67
13 75
14 104
15 125
16 165
17 194
18 258
19 302
20 392
21 467
22 588
23 700
24 885
25 1045
26 1296
27 1546
28 1897
29 2249
30 2753
31 3252
32 3945
33 4670
34 5616
35 6633
36 7957
37 9357
38 11157
39 13124
40 15573
41 18257
42 21599
43 25259
44 29760
45 34760
46 40788
47 47526
48 55642
49 64669
50 75465
51 87576
52 101898
53 117991
54 136977
55 158286

List of values

[0, 2, 3, 6, 7, 13, 14, 23, 27, 39, 45, 67, 75, 104, 125, 165, 194, 258, 302, 392, 467, 588, 700, 885, 1045, 1296, 1546, 1897, 2249, 2753, 3252, 3945, 4670, 5616, 6633, 7957, 9357, 11157, 13124, 15573, 18257, 21599, 25259, 29760, 34760, 40788, 47526, 55642, 64669, 75465, 87576, 101898, 117991, 136977, 158286]