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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079666 Least k such the distance from k^2 to closest prime = n or zero if no k exists. 0
1, 3, 8, 17, 12, 11, 18, 51, 200, 59, 238, 41, 276, 165, 104, 281, 214, 397, 348, 159, 650, 305, 778, 923, 2242, 1155, 1090, 911, 822, 1871, 1280, 1099, 1516, 3253, 2578 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

PROG

(PARI) a(n)=if(n<0, 0, s=1; while(abs(n-min(abs(precprime(s^2)-s^2), abs(nextprime(s^2)-s^2)))>0, s++); s)

CROSSREFS

Cf. A051699, A060272.

Sequence in context: A027291 A048952 A132794 * A193684 A048230 A073433

Adjacent sequences:  A079663 A079664 A079665 * A079667 A079668 A079669

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 2003

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

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

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.