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.

A326589 Sum of the smallest parts of the partitions of n into 10 parts.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 1
11 1
12 2
13 3
14 5
15 7
16 11
17 15
18 22
19 30
20 43
21 56
22 77
23 100
24 133
25 171
26 223
27 282
28 362
29 453
30 573
31 709
32 884
33 1084
34 1337
35 1626
36 1984
37 2394
38 2896
39 3468
40 4163
41 4951
42 5897
43 6972
44 8249
45 9696
46 11402
47 13330
48 15586
49 18131
50 21091
51 24417
52 28264
53 32580

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 43, 56, 77, 100, 133, 171, 223, 282, 362, 453, 573, 709, 884, 1084, 1337, 1626, 1984, 2394, 2896, 3468, 4163, 4951, 5897, 6972, 8249, 9696, 11402, 13330, 15586, 18131, 21091, 24417, 28264, 32580]