A309762 -id:A309762 - cp's OEIS frontend

A003337 Numbers n which are the sum of 3 nonzero 4th powers.

3, 18, 33, 48, 83, 98, 113, 163, 178, 243, 258, 273, 288, 338, 353, 418, 513, 528, 593, 627, 642, 657, 707, 722, 768, 787, 882, 897, 962, 1137, 1251, 1266, 1298, 1313, 1328, 1331, 1378, 1393, 1458, 1506, 1553, 1568, 1633, 1808, 1875, 1922, 1937, 2002, 2177

Offset: 1

N. J. A. Sloane

Numbers which are in this sequence but not in A047714 must also be the sum of 2 biquadrates, or equal to a fourth power. Among the first 1000 terms of this sequence, this is the case for 4802 = 2*7^4, 57122 = 2*13^4 and 76832 = 2*14^4. - M. F. Hasler, Dec 31 2012
The union of A047714, A336536, and fourth powers of A003294. - Robert Israel, Jul 24 2020
As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

			From _David A. Corneth_, Aug 01 2020: (Start)
194818 is in the sequence as 194818 = 3^4 + 4^4 + 21^4.
480113 is in the sequence as 480113 = 7^4 + 12^4 + 26^4.
693842 is in the sequence as 693842 = 13^4 + 15^4 + 28^4. (End)

David A. Corneth, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
Eric Weisstein's World of Mathematics, Biquadratic Number.

Cf. A003294, A047714, A336536, A309762, A344188.
A###### (x, y): Numbers that are the form of x nonzero y-th powers.
Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

def aupto(lim):
  p1 = set(i**4 for i in range(1, int(lim**.25)+2) if i**4 <= lim)
  p2 = set(a+b for a in p1 for b in p1 if a+b <= lim)
  p3 = set(apb+c for apb in p2 for c in p1 if apb+c <= lim)
  return sorted(p3)
print(aupto(2400)) # Michael S. Branicky, Mar 18 2021

A008917 Numbers that are the sum of 3 positive cubes in more than one way.

Original entry on oeis.org

251, 1009, 1366, 1457, 1459, 1520, 1730, 1737, 1756, 1763, 1793, 1854, 1945, 2008, 2072, 2241, 2414, 2456, 2458, 2729, 2736, 3060, 3391, 3457, 3592, 3599, 3655, 3745, 3926, 4105, 4112, 4131, 4168, 4229, 4320, 4376, 4402, 4437, 4447

Offset: 1

N. J. A. Sloane and J. H. Conway

Of course reordering the terms does not count.

A025456(a(n)) > 1. [Reinhard Zumkeller, Apr 23 2009]

			a(2) = 1009 = 1^3+2^3+10^3 = 4^3+6^3+9^3.

T. D. Noe and Christian N. K. Anderson, Table of n, a(n) for n = 1..10000 (first 1000 terms are from T. D. Noe)
Christian N. K. Anderson, Decomposition of first 10000 terms into multiple cube triples.

Cf. A001235, A003072, A024796, A025396, A025398, A025406, A309762.

Select[Range[4450], 1 < Length @ Cases[PowersRepresentations[#, 3, 3], {?Positive, ?Positive, ?Positive}] &]  (* _Jean-François Alcover, Apr 04 2011 *)

is(n)=k=ceil((n-2)^(1/3)); d=0; for(a=1, k, for(b=a, k, for(c=b, k, if(a^3+b^3+c^3==n, d++)))); d
n=3; while(n<5000, if(is(n)>1, print1(n, ", ")); n++) \\ Derek Orr, Aug 27 2015

A018786 Numbers that are the sum of two 4th powers in more than one way.

Original entry on oeis.org

635318657, 3262811042, 8657437697, 10165098512, 51460811217, 52204976672, 68899596497, 86409838577, 138519003152, 160961094577, 162641576192, 264287694402, 397074160625, 701252453457, 823372979472, 835279626752

Offset: 1

David W. Wilson

nonn

Since 4th powers are squares, this is a subsequence of A024508, the analog for squares. Sequence A001235 is the analog for third powers (taxicab numbers). Sequence A255351 lists max {a,b,c,d} where a^4 + b^4 = c^4 + d^4 = a(n), while A255352 lists the whole quadruples (a,b,c,d). - M. F. Hasler, Feb 21 2015

			a(1) = 59^4 + 158^4 = 133^4 + 134^4.
a(2) = 7^4 + 239^4 = 157^4 + 227^4. Note the remarkable coincidence that here all of {7, 239, 157, 227} are primes. The next larger solution with this property is 17472238301875630082 = 62047^4 + 40351^4 = 59693^4 + 46747^4. - _M. F. Hasler_, Feb 21 2015

R. K. Guy, Unsolved Problems in Number Theory, D1.

Mia Muessig, Table of n, a(n) for n = 1..30000 (terms 1..111 from Vincenzo Librandi, terms 112..4359 from Sean A. Irvine)
J. Leech, Some solutions of Diophantine equations, Proc. Camb. Phil. Soc., 53 (1957), 778-780.
Mia Muessig, Julia code for finding general taxicab numbers
Eric Weisstein's World of Mathematics, Biquadratic Number.
Eric Weisstein's World of Mathematics, Diophantine Equation.

Subsequence of A003336 (and hence A004831) and A024508 (and hence A001481).

Cf. A001235, A003336, A003824, A309762.

Select[ Split[ Sort[ Flatten[ Table[x^4 + y^4, {x, 1, 1000}, {y, 1, x}]]]], Length[#] > 1 & ][[All, 1]] (* Jean-François Alcover, Jul 26 2011 *)

n=4;L=[];for(b=1,999,for(a=1,b,t=a^n+b^n;for(c=a+1,sqrtn(t\2,n),ispower(t-c^n,n)||next;print1(t",")))) \\ M. F. Hasler, Feb 21 2015

list(lim)=my(v=List()); for(a=134,sqrtnint(lim,4)-1, my(a4=a^4); for(b=sqrtnint((4*a^2 + 6*a + 4)*a,4)+1,min(sqrtnint(lim-a4,4),a), my(t=a4+b^4); for(c=a+1,sqrtnint(lim,4), if(ispower(t-c^4,4), listput(v,t); break)))); Set(v) \\ Charles R Greathouse IV, Jul 12 2024

A weak lower bound: a(n) >> n^2. - Charles R Greathouse IV, Jul 12 2024

A309763 Numbers that are the sum of 4 nonzero 4th powers in more than one way.

Original entry on oeis.org

259, 2674, 2689, 2754, 2929, 3298, 3969, 4144, 4209, 5074, 6579, 6594, 6659, 6769, 6834, 7203, 7874, 8194, 8979, 9154, 9234, 10113, 10674, 11298, 12673, 12913, 13139, 14674, 14689, 14754, 16563, 16578, 16643, 16818, 17187, 17234, 17299, 17314, 17858, 18963, 19699

Offset: 1

Ilya Gutkovskiy, Aug 15 2019

nonn

			259 = 1^4 + 1^4 + 1^4 + 4^4 = 2^4 + 3^4 + 3^4 + 3^4, so 259 is in the sequence.

Robert Israel, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Biquadratic Number

Cf. A000583, A003338, A018786, A025367, A025406, A309762, A344193, A344238, A344241, A344644.

N:= 10^5: # for terms <= N
V:= Vector(N, datatype=integer[4]):
for a from 1 while a^4 <= N do
  for b from 1 to a while a^4+b^4 <= N do
    for c from 1 to b while a^4 + b^4+ c^4 <= N do
      for d from 1 to c do
         v:= a^4+b^4+c^4+d^4;
         if v > N then break fi;
         V[v]:= V[v]+1
od od od od:
select(i -> V[i]>1, [$1..N]); # Robert Israel, Oct 07 2019

Select[Range@20000, Length@Select[PowersRepresentations[#, 4, 4], ! MemberQ[#, 0] &] > 1 &]

A344188 Numbers that are the sum of three fourth powers in exactly one way.

Original entry on oeis.org

3, 18, 33, 48, 83, 98, 113, 163, 178, 243, 258, 273, 288, 338, 353, 418, 513, 528, 593, 627, 642, 657, 707, 722, 768, 787, 882, 897, 962, 1137, 1251, 1266, 1298, 1313, 1328, 1331, 1378, 1393, 1458, 1506, 1553, 1568, 1633, 1808, 1875, 1922, 1937, 2002, 2177, 2403, 2418, 2433, 2483, 2498, 2546, 2563, 2593, 2608, 2658

Offset: 1

David Consiglio, Jr., May 11 2021

nonn

Differs from A003337 and A047714 at term 60 because 2673 = 2^4 + 4^4 + 7^4 = 3^4 + 6^4 + 6^4, see A309762.

			33 is a member of this sequence because 33 = 1^4 + 2^4 + 2^4

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

Cf. A003337, A025395, A344187, A344189, A344192, A344641.

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

A344192 Numbers that are the sum of three fourth powers in exactly two ways.

Original entry on oeis.org

2673, 6578, 16562, 28593, 35378, 42768, 43218, 54977, 94178, 105248, 106353, 122018, 134162, 137633, 149058, 171138, 177042, 178737, 181202, 195122, 195858, 198497, 216513, 234273, 235298, 235553, 264113, 264992, 300833, 318402, 318882, 324818, 334802, 346673, 364658, 384833, 439922, 457488

Offset: 1

David Consiglio, Jr., May 11 2021

nonn

Differs from A309762 at term 59 because 811538 = 4^4 + 23^4 + 27^4 = 7^4 + 21^4 + 28^4 = 12^4 + 17^4 + 29^4

			16562 is a member of this sequence because 16562 = 1^4 + 9^4 + 10^4 = 5^4 + 6^4 + 11^4

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

Cf. A025396, A309762, A344188, A344193, A344240.

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

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

Original entry on oeis.org

811538, 1733522, 2798978, 3750578, 4614722, 5978882, 6573938, 7303842, 8878898, 12771458, 12984608, 13760258, 14677362, 15601698, 15916082, 16196193, 17868242, 20621042, 21556178, 22349522, 22673378, 25190802, 25589858, 27736352, 29969282, 30623138, 33998258, 39765362, 41532498, 44048498

Offset: 1

David Consiglio, Jr., May 12 2021

nonn

			2798978 =  6^4 + 31^4 + 37^4
        =  9^4 + 29^4 + 38^4
        = 13^4 + 26^4 + 39^4
so 2798978 is a term of this sequence.

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

Cf. A025398, A309762, A344240, A344241, A344277.

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

A345010 Numbers that are the sum of three fifth powers in two or more ways.

Original entry on oeis.org

1375298099, 1419138368, 2370099168, 5839897526, 16681039431, 27326512069, 28461637018, 34090335168, 44009539168, 45412427776, 47166830151, 57788232400, 75843173376, 89516861675, 89636142881, 140201053499, 186876720832, 191701358025, 209797492893, 220333644849

Offset: 1

David Consiglio, Jr., Jun 14 2021

nonn

No numbers that are the sum of three fifth powers in three ways have been found. As a result, there is no corresponding sequence for the sum of three fifth powers in exactly two ways.

			1419138368 is a term because 1419138368 = 13^5 + 51^5 + 64^5  = 18^5 + 44^5 + 66^5.

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

Cf. A003348, A309762, A344644.

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

A193244 Numbers that are the sum of three biquadrates (fourth powers) in more than one way.

Original entry on oeis.org

16562, 28593, 35378, 43218, 54977, 94178, 106353, 122018, 134162, 137633, 149058, 181202, 195122, 198497, 235298, 235553, 264113, 264992, 300833, 318402, 324818, 364658, 384833, 439922, 457488, 462722, 514098, 522242, 566048, 611618, 624962

Offset: 1

M. F. Hasler, Jan 01 2013

nonn

Erroneous version of A309762. - Ilya Gutkovskiy, Aug 15 2019

A subsequence of A003337. Lists the indices such that A193243(n) > 1.

			a(1) = 16562 = 1^4 + 9^4 + 10^4 = 5^4 + 6^4 + 11^4, and this is the least number having two such decompositions.

Cf. A003337, A193243, A047714, A085559, A122540, A123075.

is_A000404(n)={ for( i=1, #n=factor(n)~%4, n[1, i]==3 & n[2, i]%2 & return); n & ( vecmin(n[1, ])==1 || (n[1, 1]==2 & n[2, 1]%2))} \\ M. F. Hasler, Feb 07 2009

for(n=1,9e9, is_A000404(n) && A193243(n)>1 && print1(n","))

cp's OEIS Frontend

A003337 Numbers n which are the sum of 3 nonzero 4th powers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A008917 Numbers that are the sum of 3 positive cubes in more than one way.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A018786 Numbers that are the sum of two 4th powers in more than one way.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A309763 Numbers that are the sum of 4 nonzero 4th powers in more than one way.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A344188 Numbers that are the sum of three fourth powers in exactly one way.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A344192 Numbers that are the sum of three fourth powers in exactly two ways.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

A345010 Numbers that are the sum of three fifth powers in two or more ways.

Views

Author

Keywords

Comments