Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133490
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133490 Smallest number at distance 2n from nearest prime (variant 3). +0
1
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; listen)
OFFSET

0,1

COMMENT

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.

CROSSREFS

Sequence in context: A009378 A106708 A138551 this_sequence A051728 A005359 A008842

Adjacent sequences: A133487 A133488 A133489 this_sequence A133491 A133492 A133493

KEYWORD

nonn

AUTHOR

R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 30 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 20:00 EST 2008. Contains 151309 sequences.


AT&T Labs Research