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

A145317 Numbers n such that prime[(n + 1)^2] - prime[n^2] is a perfect cube.

Original entry on oeis.org

79, 10288, 16181, 306998, 394021
Offset: 1

Views

Author

Zak Seidov, Oct 07 2008

Keywords

Comments

n such that A011757(n + 1) - A011757(n) is a perfect cube

Examples

			p1=prime[(n + 1)^2], p= prime[n^2], p1-p2=q^3: n = 79, p1 = 63809, p = 62081, q = 12; n = 10288, p1 = 2163941687, p = 2163502711, q = 76; n = 16181, p1 = 5602364903, p = 5601635903, q = 90; n = 306998, p1=2596139184841, p = 2596121608841, q = 260. n = 394021, p1 = 4357072887373, p = 4357049981069, q = 284. Next n, if any, is > 500000.
		

Crossrefs

A145290 prime[(n + 1)^2] - prime[n^2] is a perfect square, A011757 prime(n^2).

Programs

  • Mathematica
    Select[Range[400000],IntegerQ[(Prime[(#+1)^2]-Prime[#^2])^(1/3)]&] (* Harvey P. Dale, Dec 13 2012 *)
Showing 1-1 of 1 results.