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!)
A240474 Distance from prime(n) to the closest larger squarefree number. 4

%I #8 Apr 28 2014 02:45:50

%S 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,

%T 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,

%U 2,4,1,3,3,1,2,2,1,1,1,1,2,1,2,1,3,2

%N Distance from prime(n) to the closest larger squarefree number.

%H Chris Boyd, <a href="/A240474/b240474.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A112926(n) - A000040(n). - _Michel Marcus_, Apr 10 2014

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

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

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

%K nonn

%O 1,2

%A _Chris Boyd_, Apr 06 2014

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 April 23 13:41 EDT 2024. Contains 371914 sequences. (Running on oeis4.)