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.

A330212 a(n) is the smallest k such that {1^3, 2^3, 3^3, ..., k^3} can be partitioned into n sets of equal sums.

Table of values

n a(n)
1 1
2 12
3 23
4 24
5 24
6 35
7 41
8 47
9 53
10 59
11 65
12 63

List of values

[1, 12, 23, 24, 24, 35, 41, 47, 53, 59, 65, 63]