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.
PrimePi[Select[Fibonacci[Range[80]], PrimeQ]]
print1("1, 2");forprime(p=5,47,if(isprime(fibonacci(p)),print1(", "primepi(fibonacci(p))))) \\ Charles R Greathouse IV, Aug 21 2011
Table[Prime[2^(2^n)],{n,0,5}] (* Harvey P. Dale, Oct 13 2013 *)
f(n) = for(x=0,n,print1(prime(2^2^x)","))
a(1) = prime(10) - primeGR(10) = 29 - 29 = 0.
primeGR(n) =
\\ A good approximation for the n-th prime number using
\\ the Gram-Riemann approximation of Pi(x)
{ local(x,px,r1,r2,r,p10,b,e); b=10; p10=log(n)/log(10); if(Rg(b^p10*log(b^(p10+1)))< b^p10,m=p10+1,m=p10); r1 = 0; r2 = 7.18281828; for(x=1,400, r=(r1+r2)/2; px = Rg(b^p10*log(b^(m+r))); if(px <= b^p10,r1=r,r2=r); r=(r1+r2)/2; ); floor(b^p10*log(b^(m+r))+.5); }
Rg(x) =
\\ Gram's Riemann's Approx of Pi(x)
{ local(n=1,L,s=1,r); L=r=log(x); while(s<10^40*r, s=s+r/zeta(n+1)/n; n=n+1; r=r*L/n); (s) }
Comments