The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A346356 Numbers that are the sum of six fifth powers in exactly one way. 6
 6, 37, 68, 99, 130, 161, 192, 248, 279, 310, 341, 372, 403, 490, 521, 552, 583, 614, 732, 763, 794, 825, 974, 1005, 1029, 1036, 1060, 1091, 1122, 1153, 1184, 1216, 1247, 1271, 1302, 1333, 1364, 1395, 1458, 1513, 1544, 1575, 1606, 1755, 1786, 1817, 1997, 2028 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Differs from A003351 at term 93 because 4098 = 1^5 + 3^5 + 3^5 + 3^5 + 3^5 + 5^5 = 1^5 + 1^5 + 4^5 + 4^5 + 4^5 + 4^5. LINKS Sean A. Irvine, Table of n, a(n) for n = 1..10000 EXAMPLE 6 is a term because 6 = 1^5 + 1^5 + 1^5 + 1^5 + 1^5 + 1^5. PROG (Python) 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, 6): 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]) CROSSREFS Cf. A003351, A344643, A345813, A346278, A346357. Sequence in context: A173604 A175719 A277726 * A003351 A129651 A097297 Adjacent sequences: A346353 A346354 A346355 * A346357 A346358 A346359 KEYWORD nonn AUTHOR David Consiglio, Jr., Jul 13 2021 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 11 10:53 EST 2023. Contains 367722 sequences. (Running on oeis4.)