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.

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.

Terms

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

External references