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.

A019568 a(n) = smallest k >= 1 such that {1^n, 2^n, 3^n, ..., k^n} can be partitioned into two sets with equal sum.

Table of values

n a(n)
0 2
1 3
2 7
3 12
4 16
5 24
6 31
7 39
8 47
9 44
10 60
11 71
12 79
13 79
14 87

List of values

[2, 3, 7, 12, 16, 24, 31, 39, 47, 44, 60, 71, 79, 79, 87]