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.

A240070 a(n) is the least k such that {1^n, 2^n, 3^n, ..., k^n} can be partitioned into 3 sets whose sums are equal.

Table of values

n a(n)
0 3
1 5
2 13
3 23
4 35
5 30
6 45
7 53
8 71
9 71

List of values

[3, 5, 13, 23, 35, 30, 45, 53, 71, 71]