A345815 -id:A345815 - cp's OEIS frontend

A048931 Numbers that are the sum of 6 positive cubes in exactly 3 ways.

221, 254, 369, 411, 443, 469, 495, 502, 576, 595, 600, 648, 658, 684, 704, 711, 720, 739, 746, 753, 760, 765, 767, 772, 774, 779, 786, 793, 811, 818, 828, 835, 844, 854, 863, 866, 874, 880, 884, 886, 892, 893, 899, 905, 910, 919, 928, 929, 935, 936, 937

Offset: 1

Eric W. Weisstein

It appears that this sequence has 1141 terms, the last of which is 26132. - Donovan Johnson, Jan 09 2013

			221 is in the sequence since 221 = 216+1+1+1+1+1 = 125+64+8+8+8+8 = 64+64+64+27+1+1.

Donovan Johnson, Table of n, a(n) for n = 1..1141 (terms < 10^7)
Eric Weisstein's World of Mathematics, Cubic Number.

Cf. A003329, A048929, A048930, A343705, A345512, A345766, A345775, A345815.

Reap[For[n = 1, n <= 1000, n++, pr = Select[ PowersRepresentations[n, 6, 3], Times @@ # != 0 &]; If[pr != {} && Length[pr] == 3, Print[n, pr]; Sow[n]]]][[2, 1]] (* Jean-François Alcover, Jul 31 2013 *)

mx=10^6; ct=vector(mx); cb=vector(99); for(i=1, 99, cb[i]=i^3); for(i1=1, 99, s1=cb[i1]; for(i2=i1, 99, s2=s1+cb[i2]; if(s2+4*cb[i2]>mx, next(2)); for(i3=i2, 99, s3=s2+cb[i3]; if(s3+3*cb[i3]>mx, next(2)); for(i4=i3, 99, s4=s3+cb[i4]; if(s4+2*cb[i4]>mx, next(2)); for(i5=i4, 99, s5=s4+cb[i5]; if(s5+cb[i5]>mx, next(2)); for(i6=i5, 99, s6=s5+cb[i6]; if(s6>mx, next(2)); ct[s6]++)))))); n=0; for(i=6, mx, if(ct[i]==3, n++; write("b048931.txt", n " " i))) /* Donovan Johnson, Jan 09 2013 */

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Oct 02 2000

A344244 Numbers that are the sum of five fourth powers in exactly three ways.

Original entry on oeis.org

4225, 6610, 6850, 9170, 9235, 9490, 11299, 12929, 14209, 14690, 14755, 14770, 15314, 16579, 16594, 16659, 16834, 17203, 17235, 17315, 17859, 17874, 17939, 18785, 18850, 18979, 19154, 19700, 19715, 20674, 21250, 21330, 21364, 21410, 21954, 23139, 23795, 24754, 25810, 26578, 28610, 28930, 29330, 29699

Offset: 1

David Consiglio, Jr., May 12 2021

nonn

Differs from A344243 at term 31 because 20995 = 1^4 + 1^4 + 1^4 + 4^4 + 12^4 = 2^4 + 3^4 + 3^4 + 3^4 + 12^4 = 2^4 + 6^4 + 9^4 + 9^4 + 9^4 = 4^4 + 6^4 + 7^4 + 7^4 + 11^4

			6850 is a member of this sequence because 6850 =  = 1^4 + 2^4 + 2^4 + 4^4 + 9^4 = 2^4 + 3^4 + 4^4 + 7^4 + 8^4 = 3^4 + 3^4 + 6^4 + 6^4 + 8^4

David Consiglio, Jr., Table of n, a(n) for n = 1..20000

Cf. A342688, A343705, A344237, A344242, A344243, A344355, A345815.

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

A345560 Numbers that are the sum of six fourth powers in three or more ways.

Original entry on oeis.org

2676, 2851, 2916, 4131, 4226, 4241, 4306, 4371, 4481, 4850, 5346, 5411, 5521, 5586, 5651, 6561, 6611, 6626, 6691, 6756, 6771, 6801, 6821, 6836, 6851, 6866, 6931, 7106, 7235, 7475, 7491, 7666, 7841, 7906, 7971, 8146, 8211, 8321, 8386, 8451, 8531, 8706, 9011

Offset: 1

David Consiglio, Jr., Jun 20 2021

nonn

			2851 is a term because 2851 = 1^4 + 1^4 + 1^4 + 4^4 + 6^4 + 6^4 = 2^4 + 2^4 + 3^4 + 3^4 + 4^4 + 7^4 = 2^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4.

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

Cf. A344243, A345512, A345559, A345561, A345569, A345604, A345815.

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

A345814 Numbers that are the sum of six fourth powers in exactly two ways.

Original entry on oeis.org

261, 276, 291, 341, 356, 421, 516, 531, 596, 771, 885, 900, 965, 1140, 1361, 1509, 1556, 1571, 1636, 1811, 2180, 2596, 2611, 2661, 2691, 2706, 2721, 2741, 2756, 2771, 2786, 2836, 2931, 2946, 2961, 3011, 3026, 3091, 3186, 3201, 3220, 3266, 3285, 3300, 3315

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345559 at term 25 because 2676 = 1^4 + 1^4 + 2^4 + 4^4 + 7^4 = 1^4 + 1^4 + 1^4 + 3^4 + 6^4 + 6^4 = 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 7^4.

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

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

Cf. A048930, A344237, A345559, A345813, A345815, A345824, A346357.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**4 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])

A345816 Numbers that are the sum of six fourth powers in exactly four ways.

Original entry on oeis.org

6626, 6691, 6866, 9251, 9491, 10115, 10706, 10786, 11555, 12595, 14225, 14691, 14771, 15315, 15330, 15570, 16051, 16595, 16660, 16675, 16850, 17090, 17091, 17236, 17316, 17331, 17346, 17860, 17875, 17940, 17955, 18195, 18786, 18851, 19155, 19170, 19475, 19490

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345561 at term 16 because 15395 = 1^4 + 1^4 + 1^4 + 6^4 + 8^4 + 10^4 = 1^4 + 2^4 + 5^4 + 8^4 + 8^4 + 9^4 = 3^4 + 4^4 + 4^4 + 7^4 + 7^4 + 10^4 = 3^4 + 5^4 + 7^4 + 8^4 + 8^4 + 8^4 = 2^4 + 2^4 + 2^4 + 3^4 + 5^4 + 11^4.

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

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

Cf. A344355, A345561, A345766, A345815, A345817, A345826, A346359.

Select[Range[20000],Count[PowersRepresentations[#,6,4],?(#[[1]]>0&)]==4&] (* _Harvey P. Dale, Mar 11 2023 *)

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

A345825 Numbers that are the sum of seven fourth powers in exactly three ways.

Original entry on oeis.org

2677, 2692, 2757, 2852, 2867, 2917, 2997, 3107, 3172, 3301, 3476, 3541, 3972, 4132, 4227, 4242, 4257, 4307, 4322, 4372, 4437, 4452, 4482, 4497, 4562, 4627, 4737, 4756, 4851, 4866, 4867, 4931, 4996, 5077, 5106, 5107, 5122, 5187, 5252, 5282, 5317, 5347, 5362

Offset: 1

David Consiglio, Jr., Jun 26 2021

nonn

Differs from A345569 at term 7 because 2932 = 1^4 + 1^4 + 1^4 + 2^4 + 4^4 + 4^4 + 7^4 = 1^4 + 1^4 + 1^4 + 3^4 + 4^4 + 6^4 + 6^4 = 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 4^4 + 7^4 = 2^4 + 3^4 + 3^4 + 3^4 + 3^4 + 6^4 + 6^4.

			2692 is a term because 2692 = 1^4 + 1^4 + 1^4 + 2^4 + 2^4 + 4^4 + 7^4 = 1^4 + 1^4 + 1^4 + 2^4 + 3^4 + 6^4 + 6^4 = 2^4 + 2^4 + 2^4 + 3^4 + 3^4 + 3^4 + 7^4.

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

Cf. A345569, A345775, A345815, A345824, A345826, A345835, A346280.

from itertools import combinations_with_replacement as cwr
from collections import defaultdict
keep = defaultdict(lambda: 0)
power_terms = [x**4 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])

A346358 Numbers that are the sum of six fifth powers in exactly three ways.

Original entry on oeis.org

696467, 893572, 1100264, 1109295, 1165727, 1711776, 2007401, 2025309, 2221767, 2801812, 3047519, 3310494, 3360608, 3550866, 3559556, 3576120, 3807122, 3907101, 4055922, 4093540, 4096114, 4104067, 4123363, 4135578, 4155107, 4195571, 4222339, 4326784, 4417112

Offset: 1

David Consiglio, Jr., Jul 13 2021

nonn

Differs from A345604 at term 105 because 12047994 = 7^5 + 9^5 + 12^5 + 14^5 + 17^5 + 25^5 = 5^5 + 10^5 + 13^5 + 15^5 + 16^5 + 25^5 = 1^5 + 1^5 + 3^5 + 4^5 + 21^5 + 24^5 = 4^5 + 6^5 + 15^5 + 15^5 + 21^5 + 23^5.

			696467 is a term because 696467 = 1^5 + 6^5 + 8^5 + 9^5 + 9^5 + 14^5 = 3^5 + 3^5 + 7^5 + 9^5 + 12^5 + 13^5 = 4^5 + 4^5 + 4^5 + 11^5 + 11^5 + 13^5.

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

Cf. A342688, A345604, A345815, A346280, A346357, A346359.

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

cp's OEIS Frontend

A048931 Numbers that are the sum of 6 positive cubes in exactly 3 ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A344244 Numbers that are the sum of five fourth powers in exactly three ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345560 Numbers that are the sum of six fourth powers in three or more ways.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345814 Numbers that are the sum of six fourth powers in exactly two ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A345816 Numbers that are the sum of six fourth powers in exactly four ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

A345825 Numbers that are the sum of seven fourth powers in exactly three ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A346358 Numbers that are the sum of six fifth powers in exactly three ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python