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.

A352733 Least number k such that the total number of parts in all partitions of k into consecutive parts is a record.

Table of values

n a(n)
1 1
2 3
3 6
4 9
5 15
6 21
7 30
8 35
9 45
10 63
11 90
12 105
13 135
14 165
15 189
16 210
17 225
18 297
19 315
20 495
21 525
22 630
23 825
24 945
25 1155
26 1365
27 1485
28 1575
29 2205
30 2475
31 2835
32 3465
33 4095
34 4725
35 5355
36 5775
37 5985
38 6435
39 6930
40 8085
41 8190
42 8775
43 9009
44 9450
45 10395
46 12285
47 15015
48 16065
49 17325
50 20475

List of values

[1, 3, 6, 9, 15, 21, 30, 35, 45, 63, 90, 105, 135, 165, 189, 210, 225, 297, 315, 495, 525, 630, 825, 945, 1155, 1365, 1485, 1575, 2205, 2475, 2835, 3465, 4095, 4725, 5355, 5775, 5985, 6435, 6930, 8085, 8190, 8775, 9009, 9450, 10395, 12285, 15015, 16065, 17325, 20475]