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 A096510 #7 Oct 15 2013 22:32:26 %S A096510 1,54,2,12,3,8,4792,75991,284736,6561003,51448375,964669618, %T A096510 18320500423 %N A096510 a(n) is the smallest number x such that the number of prime powers (including primes, excluding 1), in the neighborhood of x with radius ceiling(log(x)), equals n. %C A096510 With increasing n the radius of log(n) slowly increases, while frequency of prime-powers decreases. %C A096510 No more terms < 369*10^8. - _David Wasserman_, Nov 16 2007 %e A096510 a[8]=284736: because in [284723,284749] around a(8), %e A096510 8 prime(powers) occur first,with radius=r=13; %e A096510 a[0]=1;a[1]=54 means that in [50,58] only 53 is prime,r=4. %Y A096510 Cf. A096508-A096512. %Y A096510 Cf. A096509-A096523. %K A096510 more,nonn %O A096510 0,2 %A A096510 _Labos Elemer_, Jul 12 2004 %E A096510 4 more terms from _David Wasserman_, Nov 16 2007