This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A240474 #8 Apr 28 2014 02:45:50 %S A240474 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 A240474 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 A240474 2,4,1,3,3,1,2,2,1,1,1,1,2,1,2,1,3,2 %N A240474 Distance from prime(n) to the closest larger squarefree number. %H A240474 Chris Boyd, <a href="/A240474/b240474.txt">Table of n, a(n) for n = 1..10000</a> %F A240474 a(n) = A112926(n) - A000040(n). - _Michel Marcus_, Apr 10 2014 %e A240474 a(9) = 3 because 3 is the gap between prime(9) = 23 and the closest larger squarefree number 26. %o A240474 (PARI) forprime(p=1,450,for(j=p+1,2*p,if(issquarefree(j),print1(j-p", ");break))) %Y A240474 Cf. A000040, A112926, A166003, A176141, A240473, A240475, A240476. %K A240474 nonn %O A240474 1,2 %A A240474 _Chris Boyd_, Apr 06 2014