A003355 -id:A003355 - cp's OEIS frontend

A004814 Numbers that are the sum of 3 positive 11th powers.

3, 2050, 4097, 6144, 177149, 179196, 181243, 354295, 356342, 531441, 4194306, 4196353, 4198400, 4371452, 4373499, 4548598, 8388609, 8390656, 8565755, 12582912, 48828127, 48830174, 48832221, 49005273, 49007320, 49182419, 53022430

Offset: 1

N. J. A. Sloane

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

			From _David A. Corneth_, Aug 01 2020: (Start)
204800049005272 is in the sequence as 204800049005272 = 3^11 + 5^11 + 20^11.
2518268235958260 is in the sequence as 2518268235958260 = 16^11 + 19^11 + 25^11.
3786934745885995 is in the sequence as 3786934745885995 = 10^11 + 19^11 + 26^11. (End)

David A. Corneth, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)

A###### (x, y): Numbers that are the form of x nonzero y-th powers.

Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

Removed incorrect program. - David A. Corneth, Aug 01 2020

A345634 Numbers that are the sum of ten fifth powers in two or more ways.

Original entry on oeis.org

4102, 4133, 4164, 4195, 4226, 4257, 4344, 4375, 4406, 4437, 4468, 4586, 4617, 4648, 4679, 4828, 4859, 4890, 5070, 5101, 5125, 5156, 5187, 5218, 5249, 5312, 5367, 5398, 5429, 5460, 5609, 5640, 5671, 5851, 5882, 6093, 6148, 6179, 6210, 6241, 6390, 6421, 6452

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			4133 is a term because 4133 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 4^5 + 4^5 + 4^5 + 4^5 = 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 3^5 + 3^5 + 3^5 + 3^5 + 5^5.

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Cf. A003355, A345595, A345619, A345635, A346347.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**5 for x in range(1, 1000)]
for pos in cwr(power_terms, 10):
    tot = sum(pos)
    keep[tot] += 1
    rets = sorted([k for k, v in keep.items() if v >= 2])
    for x in range(len(rets)):
        print(rets[x])

A346346 Numbers that are the sum of ten fifth powers in exactly one way.

Original entry on oeis.org

10, 41, 72, 103, 134, 165, 196, 227, 252, 258, 283, 289, 314, 320, 345, 376, 407, 438, 469, 494, 500, 525, 531, 556, 587, 618, 649, 680, 711, 736, 742, 767, 798, 829, 860, 891, 922, 953, 978, 1009, 1033, 1040, 1064, 1071, 1095, 1102, 1126, 1133, 1157, 1164

Offset: 1

David Consiglio, Jr., Jul 13 2021

nonn

Differs from A003355 at term 229 because 4102 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 3^5 + 3^5 + 3^5 + 3^5 + 5^5 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 4^5 + 4^5 + 4^5 + 4^5.

			10 is a term because 10 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5.

Sean A. Irvine, Table of n, a(n) for n = 1..10000

Cf. A003355, A345853, A346336, A346347.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**5 for x in range(1, 1000)]
for pos in cwr(power_terms, 10):
    tot = sum(pos)
    keep[tot] += 1
    rets = sorted([k for k, v in keep.items() if v == 1])
    for x in range(len(rets)):
        print(rets[x])

A003386 Numbers that are the sum of 8 nonzero 8th powers.

Original entry on oeis.org

8, 263, 518, 773, 1028, 1283, 1538, 1793, 2048, 6568, 6823, 7078, 7333, 7588, 7843, 8098, 8353, 13128, 13383, 13638, 13893, 14148, 14403, 14658, 19688, 19943, 20198, 20453, 20708, 20963, 26248, 26503, 26758, 27013, 27268, 32808, 33063, 33318, 33573

Offset: 1

N. J. A. Sloane

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

			From _David A. Corneth_, Aug 01 2020: (Start)
9534597 is in the sequence as 9534597 = 2^8 + 3^8 + 3^8 + 3^8 + 5^8 + 6^8 + 6^8 + 7^8.
13209988 is in the sequence as 13209988 = 1^8 + 1^8 + 2^8 + 2^8 + 2^8 + 6^8 + 7^8 + 7^8.
19046628 is in the sequence as 19046628 = 2^8 + 2^8 + 3^8 + 4^8 + 6^8 + 7^8 + 7^8 + 7^8. (End)

David A. Corneth, Table of n, a(n) for n = 1..10000 (first 1000 terms from Vincenzo Librandi)

A###### (x, y): Numbers that are the form of x nonzero y-th powers.

Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

M = 92646056; m = M^(1/8) // Ceiling; Reap[
For[a = 1, a <= m, a++, For[b = a, b <= m, b++, For[c = b, c <= m, c++,
For[d = c, d <= m, d++, For[e = d, e <= m, e++, For[f = e, f <= m, f++,
For[g = f, g <= m, g++, For[h = g, h <= m, h++,
s = a^8 + b^8 + c^8 + d^8 + e^8 + f^8 + g^8 + h^8;
If[s <= M, Sow[s]]]]]]]]]]][[2, 1]] // Union (* Jean-François Alcover, Dec 01 2020 *)

b-file checked by R. J. Mathar, Aug 01 2020

Incorrect program removed by David A. Corneth, Aug 01 2020

A123294 Sum of 13 positive 5th powers.

Original entry on oeis.org

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

Jonathan Vos Post, Sep 24 2006

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.

			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

Giovanni Resta, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Waring's Problem.

Cf. A000584, A003336, A003347, A003349, A003350, A003351, A003352, A003353, A003354, A003355, A003356, A003357, A123295-A123297, A008480, A123299.

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 *)

Sumset {A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584}.

Two missing terms and more terms from Giovanni Resta, Jun 12 2016

A123295 Sum of 14 positive 5th powers.

Original entry on oeis.org

14, 45, 76, 107, 138, 169, 200, 231, 256, 262, 287, 293, 318, 324, 349, 355, 380, 386, 411, 417, 442, 448, 473, 498, 504, 529, 535, 560, 566, 591, 597, 622, 628, 653, 659, 684, 715, 740, 746, 771, 777, 802, 808, 833, 839, 864, 870, 895, 926, 957, 982, 988

Offset: 1

Jonathan Vos Post, Sep 24 2006

Up to 417 = 13*(2^5) + 1 this sequence is identical to x+2 for x in A003357 Sum of 12 positive 5th powers. Primes in this sequence (107, 293, 349, 653, ...) are A123300. 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.

			a(1) = 14 = 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 + 1^5.
a(2) = 45 = 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 + 2^5.
a(9) = 256 = 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 + 3^5.
a(11) = 287 = 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 + 3^5

Giovanni Resta, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Waring's Problem.

Cf. A000584, A003336, A003347, A003349, A003350, A003351, A003352, A003353, A003354, A003355, A003356, A003357, A123294-A123297, A008480, A123299, A123300.

up = 1000; q = Range[up^(1/5)]^5; a ={0}; Do[b = Select[ Union@ Flatten@ Table[e + a, {e, q}], # <= up &]; a=b, {k, 14}]; a (* Giovanni Resta, Jun 12 2016 *)

Sumset {A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584}.

5 missing terms and more terms from Giovanni Resta, Jun 12 2016

A123299 Prime sums of 13 positive 5th powers.

Original entry on oeis.org

13, 137, 199, 317, 379, 503, 683, 739, 863, 1049, 1129, 1223, 1229, 1409, 1433, 1471, 1613, 1619, 1831, 1949, 1979, 2011, 2221, 2339, 2543, 2549, 2729, 2791, 2909, 2917, 2971, 3089, 3137, 3299, 3307, 3323, 3331, 3361, 3511, 3541, 3659, 3863, 3877, 3931, 4049

Offset: 1

Jonathan Vos Post, Sep 24 2006

			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) = 137 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5.
a(3) = 199 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5.
a(4) = 317 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 3^5.

Giovanni Resta, Table of n, a(n) for n = 1..10000

Cf. A000584, A003336, A003347, A003349, A003350, A003351, A003352, A003353, A003354, A003355, A003356, A003357, A123294, A123295, A008480.

up = 4100; q = Range[up^(1/5)]^5; a = {0}; Do[b = Select[ Union@ Flatten@ Table[e + a, {e, q}], # <= up &]; a = b, {k, 13}]; Select[a, PrimeQ] (* Giovanni Resta, Jun 12 2016 *)

A000040 INTERSECTION A123299.

a(10)-a(45) from Giovanni Resta, Jun 12 2016

A123300 Prime sums of 14 positive 5th powers.

Original entry on oeis.org

107, 293, 349, 653, 659, 839, 1013, 1019, 1223, 1279, 1409, 1559, 1583, 1621, 1801, 1831, 1949, 2011, 2129, 2153, 2309, 2333, 2339, 2347, 2371, 2551, 2699, 2707, 2731, 2879, 2917, 3083, 3121, 3169, 3191, 3301, 3331, 3449, 3457, 3511, 3541, 3659, 3691, 3761, 3847, 4019, 4027, 4051

Offset: 1

Jonathan Vos Post, Sep 25 2006

			a(1) = 107 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5.
a(2) = 293 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5.
a(3) = 349 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 3^5.
a(4) = 653 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5 + 3^5.

Giovanni Resta, Table of n, a(n) for n = 1..10000

Cf. A000584, A003336, A003347, A003349, A003350, A003351, A003352, A003353, A003354, A003355, A003356, A003357, A123294-A123299.

up = 5000; q = Range[up^(1/5)]^5; a={0}; Do[b = Select[Union@ Flatten@ Table[e + a, {e, q}], # <= up &]; a = b, {k, 14}]; Select[a, PrimeQ] (* Giovanni Resta, Jun 12 2016 *)

A000040 INTERSECTION A123295.

More terms from Harvey P. Dale, Jan 01 2015

4 missing terms from Giovanni Resta, Jun 12 2016

A123039 Prime sums of 11 positive 5th powers.

Original entry on oeis.org

11, 73, 197, 439, 557, 563, 619, 743, 1103, 1283, 1307, 1493, 1549, 2243, 2251, 2399, 2423, 2579, 2969, 3001, 3259, 3329, 3391, 3539, 3571, 3719, 3923, 4079, 4289, 4493, 4649, 4673, 5039, 5281, 5399, 5641, 5851, 6211, 6359, 6367, 6421, 6563, 6719, 6781, 6961

Offset: 1

Jonathan Vos Post, Sep 24 2006

Primes in the sumset {A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584}.

There must be an odd number of odd terms in the sum, either eleven odd (as with 11 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5), two even and nine odd (as with 73 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 and 557 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 3^5 + 3^5), four even and seven odd (as with 619 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5 + 3^5), six even and 5 odd terms (as with 197 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 and 439 = 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5), eight even and 3 odd terms (as with 743 = 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5 + 3^5) or ten even terms and one odd term (as with 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5). The sum of two positive 5th powers (A003347), other than 2 = 1^5 + 1^5, cannot be prime.

			a(1) = 11 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5.
a(2) = 73 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5.
a(3) = 197 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5.
a(4) = 439 = 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5.
a(5) = 557 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 3^5 + 3^5.
a(6) = 563 = 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5.
a(7) = 619 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5 + 3^5.
a(8) = 743 = 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5 + 3^5.

Giovanni Resta, Table of n, a(n) for n = 1..10000

Cf. A000040, A000584, A003336, A003347, A003349, A003350, A003351, A003352, A003353, A003354, A003355, A003356.

up = 6961; q = Range[up^(1/5)]^5; a = {0}; Do[b = Select[Union@ Flatten@ Table[e + a, {e, q}], # <= up &]; a = b, {k, 11}]; Select[a, PrimeQ] (* Giovanni Resta, Jun 12 2016 *)

A000040 INTERSECTION A003356.

More terms from Alois P. Heinz, Aug 12 2015

A123040 Prime sums of 12 positive 5th powers.

Original entry on oeis.org

43, 167, 229, 347, 353, 409, 769, 1097, 1277, 1283, 1439, 1619, 1823, 1861, 1979, 2003, 2089, 2213, 2221, 2393, 2549, 2579, 2729, 2791, 2939, 2971, 3001, 3119, 3167, 3181, 3229, 3299, 3323, 3329, 3361, 3533, 3541, 3571, 3697, 3931, 4049, 4079, 4111, 4159, 4259

Offset: 1

Jonathan Vos Post, Sep 24 2006

Primes in the sumset {A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584 + A000584}. There must be an odd number of odd terms in the sum, either one even and eleven odd (as with 11 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 and 769 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 3^5 + 3^5 + 3^5), three even and nine odd (as with 347 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 3^5), five even and seven odd (as with 167 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 and 409 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5), seven even and 5 odd terms (as with 229 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5), nine even and 3 odd terms (as with 161341 = 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 11^5) or eleven even terms and one odd term (as with 353 = 1^ 5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5). The sum of two positive 5th powers (A003347), other than 2 = 1^5 + 1^5, cannot be prime.

			a(1) = 43 = 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(2) = 167 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5.
a(3) = 229 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5.
a(4) = 347 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 3^5.
a(5) = 353 = 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5.
a(6) = 409 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 2^5 + 2^5 + 2^5 + 2^5 + 3^5.
a(7) = 769 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 2^5 + 3^5 + 3^5 + 3^5.

Matthew House, Table of n, a(n) for n = 1..10000

Cf. A000040, A000584, A003336, A003347, A003349, A003350, A003351, A003352, A003353, A003354, A003355, A003356, A003357.

N:= 10000: # to get all terms <= N
B:= {seq(i^5,i=1..floor(N^(1/5)))}:
B2:= select(`<=`,{seq(seq(b+c,b=B),c=B)},N):
B4:= select(`<=`,{seq(seq(b+c,b=B2),c=B2)},N):
B8:= select(`<=`,{seq(seq(b+c,b=B4),c=B4)},N):
B12:= select(`<=`,{seq(seq(b+c,b=B4),c=B8)},N):
sort(select(isprime,convert(B12,list))); # Robert Israel, Aug 10 2015

A000040 INTERSECTION A003357.

More terms from Matthew House, Aug 10 2015

cp's OEIS Frontend

A004814 Numbers that are the sum of 3 positive 11th powers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A345634 Numbers that are the sum of ten fifth powers in two or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A346346 Numbers that are the sum of ten fifth powers in exactly one way.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A003386 Numbers that are the sum of 8 nonzero 8th powers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A123294 Sum of 13 positive 5th powers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A123295 Sum of 14 positive 5th powers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A123299 Prime sums of 13 positive 5th powers.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A123300 Prime sums of 14 positive 5th powers.

Views

Author

Keywords

Examples