login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102723 Smallest prime a(n) such that a(n)-x and a(n)+x, for x=1 to n, are all composite. 1
5, 23, 23, 53, 53, 211, 211, 211, 211, 211, 211, 1847, 1847, 2179, 2179, 2179, 2179, 3967, 3967, 16033, 16033, 16033, 16033, 24281, 24281, 24281, 24281, 24281, 24281, 38501, 38501, 38501, 38501, 38501, 38501, 38501, 38501, 38501, 38501, 58831 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(2n+1)=a(2n). - Robert G. Wilson v, Feb 22 2005

LINKS

Table of n, a(n) for n=1..40.

MATHEMATICA

f[n_] := Block[{k = 1}, While[ Union[ PrimeQ /@ Sort[ Flatten[ Table[{Prime[k] - i, Prime[k] + i}, {i, n}]]]] != {False}, k++ ]; Prime[k]]; Table[ f[n], {n, 40}] (from Robert G. Wilson v Feb 22 2005)

CROSSREFS

Cf. A023186.

Sequence in context: A177242 A233756 A002582 * A136146 A167804 A196243

Adjacent sequences:  A102720 A102721 A102722 * A102724 A102725 A102726

KEYWORD

nonn

AUTHOR

Ray G. Opao, Feb 06 2005

EXTENSIONS

a(12)-a(40) from Robert G. Wilson v, Feb 22 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 26 01:49 EST 2014. Contains 250017 sequences.