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.

A079611 Waring's problem: conjectured values for G(n), the smallest number m such that every sufficiently large number is the sum of at most m n-th powers of positive integers.

Table of values

n a(n)
1 1
2 4
3 4
4 16
5 6
6 9
7 8
8 32
9 13
10 12
11 12
12 16
13 14
14 15
15 16
16 64
17 18
18 27
19 20
20 25

List of values

[1, 4, 4, 16, 6, 9, 8, 32, 13, 12, 12, 16, 14, 15, 16, 64, 18, 27, 20, 25]