login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A240473 Distance from prime(n) to the closest smaller squarefree number. 6
1, 1, 2, 1, 1, 2, 2, 2, 1, 3, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 4, 1, 1, 2, 2, 4, 1, 3, 1, 3, 2, 2, 2, 1, 3, 1, 2, 1, 2, 2, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 3, 3, 1, 2, 2, 1, 2, 3, 1, 2, 1, 2, 4, 1, 1, 2, 2, 1, 3, 2, 2, 2, 1, 2, 1, 2, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Chris Boyd, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A000040(n) - A112925(n). - Michel Marcus, Apr 10 2014

EXAMPLE

a(10) = 3 because 3 is the gap between prime(10) = 29 and the closest smaller squarefree number 26.

PROG

(PARI) forprime(p=1, 450, forstep(j=p-1, 1, -1, if(issquarefree(j), print1(p-j", "); break)))

CROSSREFS

Cf. A000040, A112925, A166003, A176141, A240474, A240475, A240476.

Sequence in context: A112758 A029437 A227908 * A286569 A131335 A225332

Adjacent sequences:  A240470 A240471 A240472 * A240474 A240475 A240476

KEYWORD

nonn

AUTHOR

Chris Boyd, Apr 06 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 03:54 EDT 2020. Contains 337289 sequences. (Running on oeis4.)