A345498 -id:A345498 - cp's OEIS frontend

A345499 Numbers that are the sum of nine squares in two or more ways.

24, 27, 30, 32, 33, 35, 36, 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, 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

			27 is a term because 27 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 2^2 + 4^2 = 1^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. A345489, A345498, A345500, A345509, A345541.

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, 9):
    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])

A345508 Numbers that are the sum of ten squares in one or more ways.

Original entry on oeis.org

10, 13, 16, 18, 19, 21, 22, 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, 79, 80, 81

Offset: 1

David Consiglio, Jr., Jun 19 2021

nonn

			13 is a term because 13 = 1^2 + 1^2 + 1^2 + 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. A003333, A025429, A345498, A345509.

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, 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])

def A345508(n): return (10, 13, 16, 18, 19, 21, 22)[n-1] if n<8 else n+16 # Chai Wah Wu, May 09 2024

From Chai Wah Wu, May 09 2024: (Start)
All integers >= 24 are terms. Proof: since 5 can be written as the sum of 5 positive squares and any integer >= 34 can be written as a sum of 5 positive squares (see A025429), any integer >= 39 can be written as a sum of 10 positive squares. Integers from 24 to 38 are terms by inspection.
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 - 7*x + 10)/(x - 1)^2. (End)

A345488 Numbers that are the sum of eight squares in one or more ways.

Original entry on oeis.org

8, 11, 14, 16, 17, 19, 20, 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, 79

Offset: 1

David Consiglio, Jr., Jun 19 2021

nonn

			11 is a term because 11 = 1^2 + 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. A003331, A345478, A345489, A345498, A345508.

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

From Chai Wah Wu, Jun 12 2025: (Start)
All integers >= 22 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 - 5*x + 8)/(x - 1)^2. (End)

cp's OEIS Frontend

A345499 Numbers that are the sum of nine squares in two or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345508 Numbers that are the sum of ten squares in one or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

Python

Formula

A345488 Numbers that are the sum of eight squares in one or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

Formula