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 A064661 #11 Jun 21 2018 02:00:36
%S A064661 -1,0,0,1,1,1,1,2,2,2,2,2,2,3,3,3,3,4,4,4,4,4,5,5,4,5,5,6,6,7,5,6,6,6,
%T A064661 6,6,6,7,7,7,7,8,7,8,8,9,8,7,8,8,9,9,10,9,9,9,9,10,10,11,11,11,10,10,
%U A064661 11,11,10,11,10,11,11,11,11,12,12,12,12,12,13,12,12
%N A064661 a(n) = n - floor( prime(n)/log(prime(n)) ).
%H A064661 Harry J. Smith, <a href="/A064661/b064661.txt">Table of n, a(n) for n = 1..1000</a>
%t A064661 Table[n-Floor[Prime[n]/Log[Prime[n]]],{n,90}] (* _Harvey P. Dale_, Sep 27 2017 *)
%o A064661 (PARI) { for (n=1, 1000, write("b064661.txt", n, " ", n - prime(n)\log(prime(n))) ) } \\ _Harry J. Smith_, Sep 21 2009
%Y A064661 Cf. A064659-A064663.
%K A064661 sign
%O A064661 1,8
%A A064661 _N. J. A. Sloane_, Oct 10 2001