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”).

A104202
Differences of straddle primes.
0
2, 2, 4, 4, 4, 2, 4, 4, 4, 2, 4, 4, 4, 6, 6, 6, 6, 6, 2, 6, 6, 6, 6, 6, 4, 4, 4, 2, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 6, 6, 6, 6, 6, 4, 4, 4, 2, 6, 6, 6, 6, 6, 4, 4, 4, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 2, 4, 4, 4, 2, 4, 4, 4, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 4, 4, 4, 6
OFFSET
4,1
FORMULA
Straddle primes are the nearest primes preceding and following composite n.
EXAMPLE
The first straddle prime pair is 3 and 5 which straddles the composite number 4 and 5-3 = 2 the first entry in the table.
MATHEMATICA
NextPrime[#]-NextPrime[#, -1]&/@Rest[Select[Range[200], !PrimeQ[#]&]] (* Harvey P. Dale, Aug 23 2012 *)
PROG
(PARI) straddiff(n) = { local (x, y, pp, np); for(x=1, n, y=composite(x); pp=precprime(y); np=nextprime(y); print1(np-pp", ") )
composite(n) = { local(c, x); c=1; x=1; while(c <= n, x++; if(!isprime(x), c++); ); return(x) } }
CROSSREFS
Sequence in context: A006460 A064137 A329588 * A042946 A037202 A227091
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Mar 13 2005
STATUS
approved