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!)
A240474 Distance from prime(n) to the closest larger squarefree number. 4
1, 2, 1, 3, 2, 1, 2, 2, 3, 1, 2, 1, 1, 3, 4, 2, 2, 1, 2, 2, 1, 3, 2, 2, 4, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 3, 1, 2, 3, 1, 2, 1, 2, 1, 2, 2, 2, 3, 2, 1, 2, 2, 5, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 3, 2, 2, 4, 1, 3, 3, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

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

EXAMPLE

a(9) = 3 because 3 is the gap between prime(9) = 23 and the closest larger squarefree number 26.

PROG

(PARI) forprime(p=1, 450, for(j=p+1, 2*p, if(issquarefree(j), print1(j-p", "); break)))

CROSSREFS

Cf. A000040, A112926, A166003, A176141, A240473, A240475, A240476.

Sequence in context: A026141 A089209 A153359 * A023510 A005678 A296976

Adjacent sequences:  A240471 A240472 A240473 * A240475 A240476 A240477

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 June 1 02:09 EDT 2020. Contains 334758 sequences. (Running on oeis4.)