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-2 of 2 results.

A165455 Primes p such that p^2 is a sum of three distinct positive cubes.

Original entry on oeis.org

53, 59, 71, 163, 167, 251, 523, 577, 613, 643, 773, 787, 811, 827, 863, 881, 883, 919, 937, 1097, 1117, 1301, 1567, 1607, 1709, 1777, 1867, 1873, 1877, 1889, 1931, 2161, 2237, 2309, 2447, 2521, 2591, 2647, 2687, 2719, 2843, 2897, 2969, 3011, 3079, 3163
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    lst={};Do[Do[Do[d=Sqrt[a^3+b^3+c^3];If[d<=834&&IntegerQ[d]&&PrimeQ[d], AppendTo[lst,d]],{c,b+1,5!,1}],{b,a+1,5!,1}],{a,5!}];Union@lst

Formula

A000040 INTERSECT A165454.
{p: p in A000040 and p^2 in A024975}. [R. J. Mathar, Oct 07 2009]

Extensions

Extended beyond 827 by R. J. Mathar, Oct 07 2009
Title corrected by Jeppe Stig Nielsen, Jan 26 2015

A271826 Integers n such that n^2 = x^3 + y^3 + z^3, where x, y, z are positive integers, is soluble.

Original entry on oeis.org

6, 9, 15, 27, 48, 53, 59, 71, 72, 78, 84, 87, 90, 96, 98, 100, 116, 120, 121, 125, 134, 153, 162, 163, 167, 180, 188, 204, 213, 215, 216, 224, 225, 226, 230, 240, 242, 243, 244, 251, 253, 255, 262, 264, 279, 280, 287, 288, 289, 303, 314, 324, 330, 342
Offset: 1

Views

Author

Altug Alkan, Apr 15 2016

Keywords

Comments

Intersection of A000290 and A003072.
Corresponding squares are 36, 81, 225, 729, 2304, 2809, 3481, 5041, ...
A165454 is a subsequence.
Terms that are not listed in A165454 are 9, 72, 100, 215, 243, 279, 289, ...

Examples

			6 is a term because 6^2 = 1^3 + 2^3 + 3^3.
9 is a term because 9^2 = 3^3 + 3^3 + 3^3.
15 is a term because 15^2 = 1^3 + 2^3 + 6^3.
		

Crossrefs

Programs

  • PARI
    list(lim) = my(v=List(), k, t); lim\=1; for(x=1, sqrtnint(lim-2, 3), for(y=1, min(sqrtnint(lim-x^3-1, 3), x), k=x^3+y^3; for(z=1, min(sqrtnint(lim-k, 3), y), if(issquare(k+z^3), listput(v, round(sqrt(k+z^3))))))); Set(v);
Showing 1-2 of 2 results.