A033559 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A033559

a(n) = (q - p)/2, where p is the largest prime < n and q is the smallest prime > n.

1, 2, 1, 3, 2, 2, 2, 3, 1, 3, 2, 2, 2, 3, 1, 3, 2, 2, 2, 5, 3, 3, 3, 3, 3, 4, 1, 4, 3, 3, 3, 3, 3, 5, 2, 2, 2, 3, 1, 3, 2, 2, 2, 5, 3, 3, 3, 3, 3, 6, 3, 3, 3, 3, 3, 4, 1, 4, 3, 3, 3, 3, 3, 5, 2, 2, 2, 3, 1, 4, 3, 3, 3, 3, 3, 5, 2, 2, 2, 5, 3, 3, 3, 3, 3, 7, 4, 4, 4, 4, 4, 4, 4, 6, 2, 2, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

4,2

LINKS

Table of n, a(n) for n=4..100.

Jean-François Alcover, Frequency distribution up to 10^6 terms.

MATHEMATICA

a[n_] := (NextPrime[n] - NextPrime[n, -1])/2; Table[a[n], {n, 4, 100}] (* Jean-François Alcover, Apr 16 2013 *)

CROSSREFS

Sequence in context: A377168 A273568 A140720 * A279027 A103151 A035221

Adjacent sequences: A033556 A033557 A033558 * A033560 A033561 A033562

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Ben Paul Thurston, Mar 30 2007

STATUS

approved