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.

A375154 Least k with exactly n partitions k = x + y + z satisfying sigma(k) = sigma(x) + sigma(y) + sigma(z).

Table of values

n a(n)
1 5
2 25
3 33
4 39
5 38
6 58
7 65
8 86
9 123
10 85
11 82
12 92
13 98
14 152
15 99
16 158
17 106
18 135
19 153
20 145
21 215
22 186
23 142
24 189
25 235
26 178
27 185
28 165
29 147
30 315
31 274
32 231
33 214
34 305
35 171
36 332
37 207
38 290
39 310
40 344
41 266
42 358
43 583
44 297
45 261
46 278
47 285
48 488
49 255
50 334
51 302
52 369
53 309
54 2888
55 284

List of values

[5, 25, 33, 39, 38, 58, 65, 86, 123, 85, 82, 92, 98, 152, 99, 158, 106, 135, 153, 145, 215, 186, 142, 189, 235, 178, 185, 165, 147, 315, 274, 231, 214, 305, 171, 332, 207, 290, 310, 344, 266, 358, 583, 297, 261, 278, 285, 488, 255, 334, 302, 369, 309, 2888, 284]