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.

A195820 Total number of smallest parts in all partitions of n that do not contain 1 as a part.

Table of values

n a(n)
1 0
2 1
3 1
4 3
5 2
6 7
7 5
8 12
9 13
10 22
11 22
12 43
13 43
14 67
15 81
16 117
17 133
18 195
19 223
20 312
21 373
22 492
23 584
24 782
25 925
26 1190
27 1433
28 1820
29 2170
30 2748
31 3268
32 4075
33 4872
34 5997
35 7150
36 8781
37 10420
38 12669
39 15055
40 18198
41 21535
42 25925
43 30602
44 36624
45 43201
46 51428
47 60478
48 71802
49 84215

List of values

[0, 1, 1, 3, 2, 7, 5, 12, 13, 22, 22, 43, 43, 67, 81, 117, 133, 195, 223, 312, 373, 492, 584, 782, 925, 1190, 1433, 1820, 2170, 2748, 3268, 4075, 4872, 5997, 7150, 8781, 10420, 12669, 15055, 18198, 21535, 25925, 30602, 36624, 43201, 51428, 60478, 71802, 84215]