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.

A061988 Find smallest k such that k^n is a sum of n n-th powers, say k^n = T(n,1)^n + ... + T(n,n)^n. Sequence gives triangle of successive rows T(n,1), ..., T(n,n). T(n,1) = ... = T(n,n) = 0 indicates no solution exists.

Table of values

n a(n)
1 1
2 3
3 4
4 3
5 4
6 5
7 30
8 120
9 272
10 315
11 19
12 43
13 46
14 47
15 67

List of values

[1, 3, 4, 3, 4, 5, 30, 120, 272, 315, 19, 43, 46, 47, 67]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.