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.
%I A364637 #13 Aug 01 2023 11:15:55
%S A364637 2,4,9,881,7809,134067,12939267,2029992385,122120396036
%N A364637 a(n) is the least k > 1 that can be represented as a sum of one or more distinct positive m-th powers for 1 <= m <= n.
%C A364637 Sprague showed that for any m, all sufficiently large integers are the sum of distinct m-th powers. A001661(m) gives the largest number not of this form, so we can use A001661 to write an upper bound for the terms here.
%H A364637 R. Sprague, <a href="https://doi.org/10.1007/BF01185779">Über Zerlegungen in n-te Potenzen mit lauter verschiedenen Grundzahlen</a>, Math. Z. 51 (1948) 466-468.
%F A364637 For n >= 2, a(n) <= 1 + Max_{m=2..n} A001661(m).
%e A364637 a(5) = 7809 as it can be written as a sum of one or more distinct positive m-th powers for 1 <= m <= 5 as follows. 1^5 + 2^5 + 6^5 = 2^4 + 6^4 + 7^4 + 8^4 = 3^3 + 5^3 + 14^3 + 17^3 = 1^2 + 8^2 + 88^2 = 7809^1 and no number less than 7809 can be written as such.
%Y A364637 Sequences giving solutions for related problems: A001661, A030052.
%K A364637 nonn,more,hard
%O A364637 1,1
%A A364637 _David A. Corneth_ and _Peter Munn_, Jul 30 2023