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.

A375618 a(n) is the least positive integer k such that there are n partitions k = x + y + z of positive integers such that x * y * z is a perfect cube or -1 if no such positive integer exists.

Table of values

n a(n)
0 1
1 3
2 20
3 21
4 57
5 94
6 133
7 219
8 217
9 273
10 453
11 434
12 551
13 589
14 399
15 791
16 665
17 893
18 1321
19 779
20 1330
21 1387
22 1519
23 1749
24 1786
25 2033
26 1767
27 2527
28 2793
29 1995
30 4066
31 3325
32 4389
33 5548
34 4557
35 3895
36 4123
37 5187
38 5890
39 5529
40 5453
41 8075
42 6213
43 7980
44 7581
45 7790
46 11275
47 8113
48 11324
49 9310

List of values

[1, 3, 20, 21, 57, 94, 133, 219, 217, 273, 453, 434, 551, 589, 399, 791, 665, 893, 1321, 779, 1330, 1387, 1519, 1749, 1786, 2033, 1767, 2527, 2793, 1995, 4066, 3325, 4389, 5548, 4557, 3895, 4123, 5187, 5890, 5529, 5453, 8075, 6213, 7980, 7581, 7790, 11275, 8113, 11324, 9310]