A345479 -id:A345479 - cp's OEIS frontend

A345520 Numbers that are the sum of seven cubes in two or more ways.

131, 159, 166, 173, 185, 192, 211, 222, 229, 236, 243, 248, 255, 257, 262, 264, 269, 274, 276, 281, 283, 285, 288, 290, 292, 295, 299, 300, 302, 307, 309, 311, 314, 318, 320, 321, 325, 332, 333, 337, 339, 340, 344, 346, 348, 351, 353, 355, 358, 359, 360, 363

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A003330, A345479, A345511, A345521, A345532, A345568, A345774.

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 >= 2])
    for x in range(len(rets)):
        print(rets[x])

A344806 Numbers that are the sum of six squares in two or more ways.

Original entry on oeis.org

21, 24, 29, 30, 33, 36, 38, 39, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			24 = 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 4^2
   = 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2
so 24 is a term.

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

Cf. A344795, A344805, A344807, A345479, A345511.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**2 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 >= 2])
    for x in range(len(rets)):
        print(rets[x])

A345480 Numbers that are the sum of seven squares in three or more ways.

Original entry on oeis.org

31, 34, 37, 39, 40, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

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

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

Cf. A344807, A345479, A345481, A345490, A345521.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**2 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 >= 3])
    for x in range(len(rets)):
        print(rets[x])

A345489 Numbers that are the sum of eight squares in two or more ways.

Original entry on oeis.org

23, 26, 29, 31, 32, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			26 is a term because 26 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 4^2 = 1^2 + 1^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2.

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

Cf. A345479, A345488, A345490, A345499, A345532.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**2 for x in range(1, 1000)]
for pos in cwr(power_terms, 8):
    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])

A345478 Numbers that are the sum of seven squares in one or more ways.

Original entry on oeis.org

7, 10, 13, 15, 16, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78

Offset: 1

David Consiglio, Jr., Jun 19 2021

nonn

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

Sean A. Irvine, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A003330, A344805, A345479, A345488, A345508.

ssQ[n_]:=Count[IntegerPartitions[n,{7}],?(AllTrue[Sqrt[#],IntegerQ]&)]>0; Select[ Range[ 80],ssQ] (* _Harvey P. Dale, Jun 22 2022 *)

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**2 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 >= 1])
    for x in range(len(rets)):
        print(rets[x])

From Chai Wah Wu, Jun 12 2025: (Start)
All integers >= 21 are terms. See A345508 for a similar proof.
a(n) = 2*a(n-1) - a(n-2) for n > 9.
G.f.: x*(-x^8 + x^7 - x^6 + x^5 - x^4 - x^3 - 4*x + 7)/(x - 1)^2. (End)

cp's OEIS Frontend

A345520 Numbers that are the sum of seven cubes in two or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A344806 Numbers that are the sum of six squares in two or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345480 Numbers that are the sum of seven squares in three or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345489 Numbers that are the sum of eight squares in two or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345478 Numbers that are the sum of seven squares in one or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula