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 A099000 #24 Aug 31 2021 01:10:34
%S A099000 1,2,3,6,24,51,251,3121,42613,23023556,143130479,2602986161967491
%N A099000 Indices k such that the k-th prime is a Fibonacci number.
%C A099000 From _Hugo Pfoertner_, Jan 06 2020: (Start)
%C A099000 The computation of the next two terms, corresponding to the primes F(131) = A005478(13) = 1066340417491710595814572169, and F(137) = A005478(14) = 19134702400093278081449423917, should already be within reach with current (2020) technology, e.g. with Kim Walisch's "primecount" program, which allows massive parallelization. An exact determination of the following term a(15), which corresponds to F(359), is beyond any imaginable technical possibility.
%C A099000 Estimates for a(13)-a(15), found by using the PARI program from A121046 in a bisection loop, with an accuracy that corresponds to the shown number of digits, are as follows:
%C A099000 a(13) = primepi(F(131)) ~= 1.741898800848...*10^25,
%C A099000 a(14) = primepi(F(137)) ~= 2.9848914766265...*10^26,
%C A099000 a(15) = primepi(F(359)) ~= 2.78114064956041656819790214151422895...*10^72.
%C A099000 (End)
%F A099000 a(n) = A000720(A005478(n)). - _M. F. Hasler_, Aug 21 2011
%t A099000 PrimePi[Select[Fibonacci[Range[80]], PrimeQ]]
%o A099000 (PARI) print1("1, 2");forprime(p=5,47,if(isprime(fibonacci(p)),print1(", "primepi(fibonacci(p))))) \\ _Charles R Greathouse IV_, Aug 21 2011
%Y A099000 Cf. A001605 (n-th Fibonacci number is prime), A005478 (Prime Fibonacci numbers).
%Y A099000 Cf. A121046.
%K A099000 nonn,hard,more
%O A099000 1,2
%A A099000 _Rick L. Shepherd_, Nov 06 2004
%E A099000 a(11) from _Ryan Propper_, Oct 16 2005
%E A099000 a(12) from _Charles R Greathouse IV_, Aug 21 2011