login
A123294
Sum of 13 positive 5th powers.
4
13, 44, 75, 106, 137, 168, 199, 230, 255, 261, 286, 292, 317, 323, 348, 354, 379, 385, 410, 416, 441, 472, 497, 503, 528, 534, 559, 565, 590, 596, 621, 627, 652, 683, 714, 739, 745, 770, 776, 801, 807, 832, 838, 863, 894, 925, 956, 981, 987, 1012, 1018, 1036
OFFSET
1,1
COMMENTS
Up to 416 = 13*(2^5) this sequence is identical to x+1 for x in A003357 Sum of 12 positive 5th powers. Primes in this sequence (13, 137, 199, 317, ...) are A123299. As proved by J.-R. Chen in 1964, g(5) = 37, so every positive integer can be written as the sum of no more than 37 positive 5th powers. G(5) <= 17, bounding the least integer G(5) such that every positive integer beyond a certain point (i.e., all but a finite number) is the sum of G(5) 5th powers.
LINKS
Eric Weisstein's World of Mathematics, Waring's Problem.
EXAMPLE
a(1) = 13 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5.
a(2) = 44 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5.
a(9) = 255 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 3^5.
a(11) = 286 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 3^5
MATHEMATICA
up = 1500; q = Range[up^(1/5)]^5; a = {0}; Do[b = Select[ Union@ Flatten@ Table[e + a, {e, q}], # <= up &]; a = b, {k, 13}]; a (* Giovanni Resta, Jun 12 2016 *)
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Sep 24 2006
EXTENSIONS
Two missing terms and more terms from Giovanni Resta, Jun 12 2016
STATUS
approved