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 A115019 #5 Feb 18 2014 23:12:05 %S A115019 0,1,0,14,13,12,0,64,19,99,37,53,7,47,39,40,8,82,151,18,51,5,15,65,3, %T A115019 3,68,24,27,6,96,173,3,47,126,10,39,57,47,68,44,39,33,118,5,6,91,60,1, %U A115019 39,137,104,331,27,69,321,61,230,77,236,244,65,48,438,297,92,359,40,214 %N A115019 Position of the first n-digit prime in the decimal expansion of e=exp(1). %C A115019 a(10)=99 leads to the 10-digit prime 7427466391 which is the answer to the so-called "google puzzle" (January 2006). %o A115019 (PARI) \p10000 e=exp(1): f(i,l)=lift(Mod(floor(e*10^(l-1+i)),10^l)) prem(l)=local(i);i=0;while(!isprime(f(i,l)),i++);i for(l=1,1000,write(indices,Str(prem(l) ", "))) %K A115019 nonn,base %O A115019 1,4 %A A115019 Pascal Molin (colin.lampas(AT)laposte.net), Feb 23 2006