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 A036972 #19 May 10 2024 19:06:00 %S A036972 1,2,3,11,14,137,1005,5324,6486,33326,1847020051726, %T A036972 19899051754834984670 %N A036972 Numbers k such that the k-th prime is a Fibonacci number reversed. %C A036972 More terms could be obtained from A036971. %C A036972 The next reversed Fibonacci number which is a prime number is 940647607443258103531. The next term in the sequence would be the prime index for that prime. - _Harvey P. Dale_, Jun 02 2009 %H A036972 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>. %t A036972 Sort[PrimePi/@(Select[FromDigits[Reverse[IntegerDigits[ # ]]]&/@Fibonacci[Range[90]],PrimeQ])] (* _Harvey P. Dale_, Jun 02 2009 *) %Y A036972 Cf. A036797, A036971. %K A036972 nonn,more,base %O A036972 1,2 %A A036972 _N. J. A. Sloane_, _G. L. Honaker, Jr._ %E A036972 One additional term from _Harvey P. Dale_, Jun 02 2009 %E A036972 Offset corrected and a(12) added using Kim Walisch's primecount by _Amiram Eldar_, May 06 2024