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.

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

Table of values

n a(n)
1 1
2 7
3 13
4 15
5 19
6 31
7 27
8 32
9 53
10 39
11 43
12 63
13 52
14 55

List of values

[1, 7, 13, 15, 19, 31, 27, 32, 53, 39, 43, 63, 52, 55]