login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A129856
Primes that are one less than the difference between consecutive primes.
2
3, 3, 3, 5, 5, 3, 3, 5, 5, 5, 3, 5, 3, 5, 7, 3, 3, 3, 13, 3, 5, 5, 5, 3, 5, 5, 3, 11, 11, 3, 3, 5, 5, 5, 5, 5, 3, 13, 3, 3, 13, 5, 3, 5, 7, 5, 5, 3, 5, 7, 3, 7, 5, 3, 5, 7, 3, 3, 11, 7, 3, 7, 3, 5, 11, 17, 5, 5, 5, 5, 5, 5, 5, 5, 3, 11, 3, 5, 5, 11, 3, 5, 7, 7, 7, 5, 5, 3, 7, 5, 3, 7, 3, 13, 11, 3, 13, 3, 3
OFFSET
1,1
COMMENTS
Might be called Prime Prime Intervals: the sequence of prime numbers that occur as 1 less than the difference between consecutive prime numbers. - Barry Forman, Oct 14 2016
LINKS
EXAMPLE
The first 4 consecutive prime pairs are (2,3),(3,5),(5,7),(7,11). The differences - 1 are the numbers 0,1,1,3. The first three of these are not prime so 3 is the first entry in the table.
MAPLE
P:= select(isprime, [2, seq(p, p=3..10^4, 2)]):
select(isprime, [seq(P[i]-P[i-1]-1, i=2..nops(P))]); # Robert Israel, Apr 18 2016
MATHEMATICA
Select[Last[#]-First[#]&/@Partition[Prime[Range[150]], 2, 1]-1, PrimeQ] (* Harvey P. Dale, Nov 18 2013 *)
PROG
(PARI) diffp1p2(n) = { local(p1, p2, y); for(x=1, n, p1=prime(x); p2=prime(x+1); y=(p2-p1)- 1; if(isprime(y), print1(y", ") ) ) }
CROSSREFS
Sequence in context: A083574 A108025 A192451 * A136800 A126661 A369859
KEYWORD
easy,nonn,changed
AUTHOR
Cino Hilliard, May 23 2007
STATUS
approved