The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133490 Smallest number at distance 2n from nearest prime (variant 3). 0
2, 0, 23, 53, 211, 211, 211, 1341, 1343, 2179, 3967, 15705, 16033, 19635, 24281, 24281, 31429, 31431, 31433, 38501, 38501, 58831, 203713, 206699, 206699, 370311, 370313, 370315, 370317, 1272749, 1272749, 1272749, 1357265, 1357267, 2010801 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Let f(m) be the distance to the nearest prime as defined in A051700(m). Then a(n) = min { m: f(m)>= 2n}. The variants of a different definition of "distance" or demanding equality, f(m)=2n, are in A132860 and A051728.
LINKS
CROSSREFS
Sequence in context: A009378 A106708 A138551 * A051728 A201954 A005359
KEYWORD
nonn
AUTHOR
R. J. Mathar, Nov 30 2007
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 20 04:44 EDT 2024. Contains 372703 sequences. (Running on oeis4.)