A284967 -id:A284967 - cp's OEIS frontend

0, 1, 1, 0, 1, 1, 2, 1, 1, 2, 1, 3, 2, 1, 4, 3, 6, 1, 1, 1, 1, 2, 1, 3, 2, 1, 2, 2, 1, 3, 2, 10, 1, 1, 1, 1, 4, 5, 1, 1, 1, 2, 2, 1, 5, 3, 6, 3, 1, 1, 1, 2, 1, 1, 2, 1, 9, 6, 0, 6, 2, 5, 2, 1, 1, 4, 2, 1, 7, 4, 4, 7, 1, 2, 8, 3, 7, 1, 2, 4, 1, 1, 1, 2, 2, 1

Offset: 1

Vladimir Shevelev, Apr 27 2017

nonn

The sequence of positions of zeros either grows very fast or is finite. We are inclined to the latter option (cf. our comments in A284919 and in A285770). By A284967, the first three positions of zeros are {4,59,434} and, according to the last calculations by Michel Marcus, no more positions up to 5*10^7.

There are many more terms in A284919 than zeros in this sequence. The reason of this phenomenon is the following. In A284919, if n is not divisible by 3 and 2*n-3 is composite then 2*n+p is composite for every prime for which 2*n-p is prime. Indeed, for these 2*n all such primes p are in the interval (3, 2*n-3). Then either 2*n-p or 2*n+p should be divisible by 3, but 2*n-p is prime >3. So, 2*n+p is composite.

Cf. A284919, A284967, A285770.

Flatten@ Table[FirstPosition[#, p_ /; PrimeQ@ p] /. k_ /; MissingQ@ k -> {0} &@ Map[2 n + NestWhile[#/2 &, # - 1, EvenQ@ # &] &, Select[Prime@ Range@ PrimePi[2 n - 2], PrimeQ[2 n - #] &]], {n, 86}] (* Michael De Vlieger, Apr 27 2017, Version 10.2 *)

oddp(n) = n/2^valuation(n,2);
a(n) = {i = 0; forprime(p=2, 2*n, if (isprime(2*n-p), i++; if (isprime(2*n+oddp(p-1)), return(i)););); return(0);} \\ Michel Marcus, Apr 29 2017

More terms from Michael De Vlieger, Apr 27 2017

cp's OEIS Frontend

A285813 Let p_1

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Extensions