A263721 -id:A263721 - cp's OEIS frontend

A263466 Least k such that prime(n) is the smallest prime p for which k^2 + p^2 is also prime, or 0 if none.

1, 2, 4, 12, 14, 48, 178, 44, 152, 66, 224, 272, 496, 322, 408, 2068, 114, 354, 592, 584, 3192, 406, 2708, 774, 2658, 394, 4102, 2432, 3346, 2562, 8722, 4424, 9562, 2986, 6856, 1714, 21318, 5858, 7568, 16272, 7576, 4864, 6244, 29262, 29992, 9996, 10406, 58348, 16872, 11384, 12738, 22126, 9946, 24214, 81682, 46082, 74616, 88016, 6788, 30856, 21542, 38672, 131492, 62874, 75358, 95262, 39554, 83552, 65022, 73664

Offset: 1

Jonathan Sondow and Robert G. Wilson v, Nov 02 2015

nonn

The data support the conjecture in A263977 that if k > 0 is even, then k^2 + p^2 is prime for some prime p.

a(n) is the location of the first occurrence of prime(n) in A263978.

			The primes p < prime(3) = 5 are p = 2 and 3. As 1^2 + 2^2 = 5, 2^2 + 3^2 = 13, and 3^2 + 2^2 = 13 are prime, a(3) >= 4. But 4^2 + 2^2 = 20 and 4^2 + 3^2 = 25 are not prime, while 4^2 + 5^2 = 41 is prime, so a(3) = 4.

Jonathan Sondow and Robert G. Wilson v, Table of n, a(n) for n = 1..260
Stephan Baier and Liangyi Zhao, On Primes Represented by Quadratic Polynomials, Anatomy of Integers, CRM Proc. & Lecture Notes, Vol. 46, Amer. Math. Soc. 2008, pp. 169 - 166.
Étienne Fouvry and Henryk Iwaniec, Gaussian primes, Acta Arithmetica 79:3 (1997), pp. 249-287.

Cf. A240130, A240131, A263721, A263722, A263726, A263977, A263978.

f[n_] := Block[{p = 2}, While[ !PrimeQ[n^2 + p^2], p = NextPrime@ p]; p]; t = 0*Range@ 300; t[[1]] = 1; k = 2; While[k < 50000001, p = f@ k; If[ t[[PrimePi@ p]] == 0, t[[PrimePi@ p]] = k; Print[{PrimePi@ p, p, k}]]; k += 2]; t

A263978 Least prime p such that n^2 + p^2 is prime, or 0 if none.

Original entry on oeis.org

2, 3, 2, 5, 2, 5, 2, 3, 0, 3, 0, 7, 2, 11, 2, 5, 2, 5, 0, 3, 0, 5, 0, 5, 0, 5, 2, 5, 0, 11, 0, 3, 2, 5, 2, 5, 2, 3, 0, 3, 0, 5, 0, 19, 2, 5, 2, 13, 0, 7, 0, 3, 0, 11, 0, 11, 2, 3, 0, 13, 0, 3, 0, 11, 2, 29, 2, 5, 0, 3, 0, 5, 2, 5, 0, 5, 0, 7, 0, 7, 0, 3, 0, 11, 2, 11, 2, 3, 0, 11, 0, 7, 0, 5, 2, 5, 2, 3, 0, 3

Offset: 1

Jonathan Sondow and Robert G. Wilson v, Nov 06 2015

nonn

When n is odd, n^2 + p^2 is composite for all odd primes p, so a(n) = 2 or 0 according as n^2 + 2^2 is prime or not.
The locations of the zeros are in A263722.
The location of the first occurrence of prime(n) is A263466(n).

			a(1) = 2 since 1^2 + 2^2 = 5 is prime.
a(2) = 3 since 2^2 + 2^2 = 8 is not prime but 2^2 + 3^2 = 13 is prime.
a(9) = 0 since 9^2 + 2^2 = 85 is not prime.

Cf. A240130, A240131, A263466, A263721, A263722, A263726, A263977.

f[n_] := If[OddQ[n] && ! PrimeQ[n^2 + 4], 0,
  Block[{p = 2}, While[! PrimeQ[n^2 + p^2] && p < 1500, p = NextPrime@p];
   p]]; Array[f, 100]

cp's OEIS Frontend

A263466 Least k such that prime(n) is the smallest prime p for which k^2 + p^2 is also prime, or 0 if none.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica