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!)
A345527 Numbers that are the sum of seven cubes in nine or more ways. 8
1496, 1648, 1704, 1711, 1720, 1737, 1772, 1774, 1781, 1800, 1802, 1835, 1837, 1844, 1863, 1882, 1889, 1891, 1893, 1898, 1900, 1907, 1912, 1919, 1926, 1938, 1945, 1952, 1954, 1961, 1963, 1982, 1989, 1996, 2000, 2008, 2012, 2015, 2019, 2026, 2045, 2052, 2053 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

1648 is a term because 1648 = 1^3 + 1^3 + 1^3 + 2^3 + 4^3 + 7^3 + 9^3 = 1^3 + 1^3 + 1^3 + 3^3 + 4^3 + 4^3 + 10^3 = 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 5^3 + 10^3 = 1^3 + 1^3 + 3^3 + 4^3 + 5^3 + 7^3 + 8^3 = 1^3 + 2^3 + 2^3 + 5^3 + 6^3 + 6^3 + 8^3 = 1^3 + 3^3 + 3^3 + 4^3 + 4^3 + 6^3 + 9^3 = 2^3 + 3^3 + 3^3 + 3^3 + 5^3 + 6^3 + 9^3 = 2^3 + 3^3 + 3^3 + 3^3 + 3^3 + 8^3 + 8^3 = 3^3 + 3^3 + 3^3 + 5^3 + 5^3 + 7^3 + 7^3.

PROG

(Python)

from itertools import combinations_with_replacement as cwr

from collections import defaultdict

keep = defaultdict(lambda: 0)

power_terms = [x**3 for x in range(1, 1000)]

for pos in cwr(power_terms, 7):

    tot = sum(pos)

    keep[tot] += 1

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

    for x in range(len(rets)):

        print(rets[x])

CROSSREFS

Cf. A345486, A345506, A345518, A345526, A345539, A345575, A345781.

Sequence in context: A237968 A062912 A328975 * A345781 A328974 A236732

Adjacent sequences:  A345524 A345525 A345526 * A345528 A345529 A345530

KEYWORD

nonn

AUTHOR

David Consiglio, Jr., Jun 20 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 5 21:37 EDT 2022. Contains 357261 sequences. (Running on oeis4.)