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 A064663 #11 Jun 21 2018 01:58:56
%S A064663 -2,-1,-1,0,0,0,0,1,1,1,1,1,1,2,2,2,2,3,3,3,3,3,4,4,3,4,4,5,5,6,4,5,5,
%T A064663 5,5,5,5,6,6,6,6,7,6,7,7,8,7,6,7,7,8,8,9,8,8,8,8,9,9,10,10,10,9,9,10,
%U A064663 10,9,10,9,10,10,10,10,11,11,11,11,11,12,11,11,12,11
%N A064663 a(n) = n - ceiling( prime(n)/log(prime(n)) ).
%H A064663 Harry J. Smith, <a href="/A064663/b064663.txt">Table of n, a(n) for n = 1..1000</a>
%t A064663 Table[n-Ceiling[Prime[n]/Log[Prime[n]]],{n,90}] (* _Harvey P. Dale_, Dec 05 2012 *)
%o A064663 (PARI) { for (n=1, 1000, write("b064663.txt", n, " ", n - ceil( prime(n)/log(prime(n)) )) ) } \\ _Harry J. Smith_, Sep 21 2009
%Y A064663 Cf. A064659-A064662.
%K A064663 sign
%O A064663 1,1
%A A064663 _N. J. A. Sloane_, Oct 10 2001