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.

A226650 Numbers n such that the distance from 2^(2n) to the prev prime is the same as the distance from (2n)^2 to the prev prime.

Original entry on oeis.org

1, 2, 5, 7, 10, 18, 52, 83, 113, 133, 169, 226, 347, 568, 909, 4612, 8014
Offset: 1

Views

Author

Gerasimov Sergey, Jun 14 2013

Keywords

Comments

Numbers n such that 2^(2n) - (largest prime < 2^(2n)) = (2n)^2 -(largest prime < (2n)^2).
Primes in the sequence are: 2, 5, 7,...

Examples

			1 is in the sequence because the distance from 4 to 3 is the same as the distance from 4 to 3.
2 is in the sequence because the distance from 16 to 13 is the same as the distance from 16 to 13.
5 is in the sequence because the distance from 1024 to 1021 is the same as the distance from 100 to 97.
		

Crossrefs

Cf. A226381.

Programs

  • Mathematica
    dP[x_] := x - NextPrime[x, -1]; Select[Range[250]*2, (d = dP[#^2]; PrimeQ[2^# - d] && d == dP[2^#]) &]/2 (* Giovanni Resta, Jun 14 2013 *)

Extensions

a(7)-a(17) from Giovanni Resta, Jun 14 2013