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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A345607 Numbers that are the sum of seven fifth powers in four or more ways. 7

%I #6 Jul 31 2021 16:25:13

%S 893604,1117071,1182534,1414559,1629244,1933328,2280543,2586035,

%T 2867074,3050644,3055295,3055977,3256432,3329360,3369543,3436058,

%U 3551890,3576363,3896969,3914877,3930849,4055954,4087746,4088690,4093572,4096665,4098161,4104068,4104310

%N Numbers that are the sum of seven fifth powers in four or more ways.

%H Sean A. Irvine, <a href="/A345607/b345607.txt">Table of n, a(n) for n = 1..10000</a>

%e 1117071 is a term because 1117071 = 1^5 + 2^5 + 6^5 + 7^5 + 7^5 + 14^5 + 14^5 = 2^5 + 2^5 + 4^5 + 6^5 + 10^5 + 12^5 + 15^5 = 3^5 + 4^5 + 7^5 + 7^5 + 7^5 + 7^5 + 16^5 = 3^5 + 5^5 + 6^5 + 6^5 + 7^5 + 8^5 + 16^5.

%o (Python)

%o from itertools import combinations_with_replacement as cwr

%o from collections import defaultdict

%o keep = defaultdict(lambda: 0)

%o power_terms = [x**5 for x in range(1, 1000)]

%o for pos in cwr(power_terms, 7):

%o tot = sum(pos)

%o keep[tot] += 1

%o rets = sorted([k for k, v in keep.items() if v >= 4])

%o for x in range(len(rets)):

%o print(rets[x])

%Y Cf. A345570, A345606, A345608, A345612, A345718, A346281.

%K nonn

%O 1,1

%A _David Consiglio, Jr._, Jun 20 2021

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 22:09 EDT 2024. Contains 375959 sequences. (Running on oeis4.)