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.

A286014 Sum of smallest parts of all partitions of n into consecutive parts.

Table of values

n a(n)
1 1
2 2
3 4
4 4
5 7
6 7
7 10
8 8
9 15
10 11
11 16
12 15
13 19
14 16
15 27
16 16
17 25
18 26
19 28
20 22
21 38
22 26
23 34
24 31
25 40
26 31
27 50
28 29
29 43
30 49
31 46
32 32
33 62
34 41
35 59
36 48
37 55
38 46
39 74
40 46
41 61
42 67
43 64
44 46
45 94
46 56
47 70
48 63
49 77
50 69
51 98
52 55
53 79
54 85
55 92
56 61
57 110
58 71
59 88
60 93
61 91
62 76
63 131
64 64
65 110
66 103

List of values

[1, 2, 4, 4, 7, 7, 10, 8, 15, 11, 16, 15, 19, 16, 27, 16, 25, 26, 28, 22, 38, 26, 34, 31, 40, 31, 50, 29, 43, 49, 46, 32, 62, 41, 59, 48, 55, 46, 74, 46, 61, 67, 64, 46, 94, 56, 70, 63, 77, 69, 98, 55, 79, 85, 92, 61, 110, 71, 88, 93, 91, 76, 131, 64, 110, 103]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.