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.

A286015 Sum of largest parts of all partitions of n into consecutive parts.

Table of values

n a(n)
1 1
2 2
3 5
4 4
5 8
6 9
7 11
8 8
9 18
10 14
11 17
12 17
13 20
14 19
15 34
16 16
17 26
18 31
19 29
20 26
21 46
22 29
23 35
24 33
25 45
26 34
27 58
28 35
29 44
30 58
31 47
32 32
33 70
34 44
35 70
36 57
37 56
38 49
39 82
40 50
41 62
42 78
43 65
44 53
45 114
46 59
47 71
48 65
49 84
50 76
51 106
52 62
53 80
54 98
55 106
56 67
57 118
58 74
59 89
60 106
61 92
62 79
63 153
64 64
65 124

List of values

[1, 2, 5, 4, 8, 9, 11, 8, 18, 14, 17, 17, 20, 19, 34, 16, 26, 31, 29, 26, 46, 29, 35, 33, 45, 34, 58, 35, 44, 58, 47, 32, 70, 44, 70, 57, 56, 49, 82, 50, 62, 78, 65, 53, 114, 59, 71, 65, 84, 76, 106, 62, 80, 98, 106, 67, 118, 74, 89, 106, 92, 79, 153, 64, 124]

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

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