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 A240473 #10 Apr 28 2014 02:45:24 %S A240473 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, %T A240473 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, %U A240473 1,2,4,1,1,2,2,1,3,2,2,2,1,2,1,2,1,1 %N A240473 Distance from prime(n) to the closest smaller squarefree number. %H A240473 Chris Boyd, <a href="/A240473/b240473.txt">Table of n, a(n) for n = 1..10000</a> %F A240473 a(n) = A000040(n) - A112925(n). - _Michel Marcus_, Apr 10 2014 %e A240473 a(10) = 3 because 3 is the gap between prime(10) = 29 and the closest smaller squarefree number 26. %o A240473 (PARI) forprime(p=1,450,forstep(j=p-1,1,-1,if(issquarefree(j),print1(p-j", ");break))) %Y A240473 Cf. A000040, A112925, A166003, A176141, A240474, A240475, A240476. %K A240473 nonn %O A240473 1,3 %A A240473 _Chris Boyd_, Apr 06 2014