cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-8 of 8 results.

A001235 Taxi-cab numbers: sums of 2 cubes in more than 1 way.

Original entry on oeis.org

1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763, 373464, 402597, 439101, 443889, 513000, 513856, 515375, 525824, 558441, 593047, 684019, 704977
Offset: 1

Views

Author

Keywords

Comments

From Wikipedia: "1729 is known as the Hardy-Ramanujan number after a famous anecdote of the British mathematician G. H. Hardy regarding a hospital visit to the Indian mathematician Srinivasa Ramanujan. In Hardy's words: 'I remember once going to see him when he was ill at Putney. I had ridden in taxi cab number 1729 and remarked that the number seemed to me rather a dull one, and that I hoped it was not an unfavorable omen. "No," he replied, "it is a very interesting number; it is the smallest number expressible as the sum of two cubes in two different ways."'"
A011541 gives another version of "taxicab numbers".
If n is in this sequence, then n*k^3 is also in this sequence for all k > 0. So this sequence is obviously infinite. - Altug Alkan, May 09 2016

Examples

			4104 belongs to the sequence as 4104 = 2^3 + 16^3 = 9^3 + 15^3.
		

References

  • R. K. Guy, Unsolved Problems in Number Theory, Section D1.
  • G. H. Hardy, Ramanujan, Cambridge Univ. Press, 1940, p. 12.
  • Ya. I. Perelman, Algebra can be fun, pp. 142-143.
  • H. W. Richmond, On integers which satisfy the equation t^3 +- x^3 +- y^3 +- z^3, Trans. Camb. Phil. Soc., 22 (1920), 389-403, see p. 402.
  • D. Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, 165.

Crossrefs

Subsequence of A003325.
Cf. A007692, A008917, A011541, A018786, A018850 (primitive solutions), A051347 (allows negatives), A343708, A360619.
Solutions in greater numbers of ways:
(>2): A018787 (A003825 for primitive, A023050 for coprime),
(>3): A023051 (A003826 for primitive),
(>4): A051167 (A155057 for primitive).

Programs

  • Mathematica
    Select[Range[750000],Length[PowersRepresentations[#,2,3]]>1&] (* Harvey P. Dale, Nov 25 2014, with correction by Zak Seidov, Jul 13 2015 *)
  • PARI
    is(n)=my(t);for(k=ceil((n/2)^(1/3)),(n-.4)^(1/3),if(ispower(n-k^3,3),if(t,return(1),t=1)));0 \\ Charles R Greathouse IV, Jul 15 2011
    
  • PARI
    T=thueinit(x^3+1,1);
    is(n)=my(v=thue(T,n)); sum(i=1,#v,v[i][1]>=0 && v[i][2]>=v[i][1])>1 \\ Charles R Greathouse IV, May 09 2016

A343968 Numbers that are the sum of three positive cubes in four or more ways.

Original entry on oeis.org

13896, 40041, 44946, 52200, 53136, 58995, 76168, 82278, 93339, 94184, 105552, 110683, 111168, 112384, 112832, 113400, 143424, 149416, 149904, 161568, 167616, 169560, 171296, 175104, 196776, 197569, 208144, 216126, 221696, 222984, 224505, 235808, 240813, 252062, 255312, 262683, 262781, 266031
Offset: 1

Views

Author

David Consiglio, Jr., May 05 2021

Keywords

Examples

			44946 =  7^3 + 12^3 + 35^3
      =  9^3 + 17^3 + 34^3
      = 11^3 + 24^3 + 31^3
      = 16^3 + 17^3 + 33^3
so 44946 is a term.
		

Crossrefs

Programs

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

A023050 Sum of two coprime cubes in at least three ways.

Original entry on oeis.org

15170835645, 208438080643, 320465258659, 1658465000647, 3290217425101, 3938530307257, 7169838686017, 13112542594333, 24641518275703, 36592635038993, 36848138663889, 41332017729268, 74051580874005
Offset: 1

Views

Author

Keywords

Crossrefs

A051167 Sum of two positive cubes in at least five ways (all solutions).

Original entry on oeis.org

48988659276962496, 391909274215699968, 490593422681271000, 1322693800477987392, 3135274193725599744, 3924747381450168000, 6123582409620312000, 6355491080314102272, 10581550403823899136
Offset: 1

Views

Author

Keywords

Crossrefs

Extensions

Extended by Ray Chandler, Jan 19 2009

A003826 Numbers that are the sum of two cubes in at least four ways (primitive solutions).

Original entry on oeis.org

6963472309248, 12625136269928, 21131226514944, 26059452841000, 74213505639000, 95773976104625, 159380205560856, 174396242861568, 300656502205416, 376890885439488, 521932420691227, 573880096718136
Offset: 1

Views

Author

Keywords

References

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

Crossrefs

Extensions

More terms from David W. Wilson, Oct 15 1997
b-file extended by Ray Chandler, Jan 19 2009

A018787 Numbers that are the sum of two positive cubes in at least three ways (all solutions).

Original entry on oeis.org

87539319, 119824488, 143604279, 175959000, 327763000, 700314552, 804360375, 958595904, 1148834232, 1407672000, 1840667192, 1915865217, 2363561613, 2622104000, 3080802816, 3235261176, 3499524728, 3623721192, 3877315533, 4750893000, 5544709352, 5602516416
Offset: 1

Views

Author

David W. Wilson, Aug 15 1996

Keywords

References

  • J. Leech, Some solutions of Diophantine equations, Proc. Camb. Phil. Soc., 53 (1957), 778-780.
  • R. K. Guy, Unsolved Problems in Number Theory, D1.

Crossrefs

Programs

  • Mathematica
    a=Sort[Flatten@Table[n^3+m^3,{m,2000},{n,m-1,1,-1}]];f3[l_]:=Module[{t={}},Do[If[l[[n]]==l[[n+2]],AppendTo[t,l[[n]]]],{n,1,Length[l]-2}];t];f3[a] (* Vladimir Joseph Stephan Orlovsky, Jan 21 2012 *)

A025295 Numbers that are the sum of 2 nonzero squares in 4 or more ways.

Original entry on oeis.org

1105, 1625, 1885, 2125, 2210, 2405, 2465, 2665, 3145, 3250, 3445, 3485, 3625, 3770, 3965, 4225, 4250, 4420, 4505, 4625, 4745, 4810, 4930, 5125, 5185, 5330, 5365, 5525, 5785, 5945, 6205, 6290, 6305, 6409, 6500, 6565, 6625, 6890, 6970, 7085, 7225, 7250
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    nn = 7250; t = Table[0, {nn}]; lim = Floor[Sqrt[nn - 1]]; Do[num = i^2 + j^2; If[num <= nn, t[[num]]++], {i, lim}, {j, i}]; Flatten[Position[t, ?(# >= 4 &)]] (* _T. D. Noe, Apr 07 2011 *)

A345865 Numbers that are the sum of two cubes in exactly four ways.

Original entry on oeis.org

6963472309248, 12625136269928, 21131226514944, 26059452841000, 55707778473984, 74213505639000, 95773976104625, 101001090159424, 159380205560856, 169049812119552, 174396242861568, 188013752349696, 208475622728000, 300656502205416, 340878679288056
Offset: 1

Views

Author

David Consiglio, Jr., Jul 05 2021

Keywords

Comments

Differs from A023051 at term 143 because 48988659276962496 = 331954^3 + 231518^3 = 336588^3 + 221424^3 = 342952^3 + 205292^3 = 362753^3 + 107839^3 = 365757^3 + 38787^3.

Examples

			12625136269928 is a term because 12625136269928 = 21869^3 + 12939^3 = 22580^3 + 10362^3 = 23066^3 + 7068^3 = 23237^3 + 4275^3.
		

Crossrefs

Programs

  • 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, 2):
        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])
Showing 1-8 of 8 results.