Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 May 10 2024 19:06:00
%S 1,2,3,11,14,137,1005,5324,6486,33326,1847020051726,
%T 19899051754834984670
%N Numbers k such that the k-th prime is a Fibonacci number reversed.
%C More terms could be obtained from A036971.
%C 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 Kim Walisch, <a href="https://github.com/kimwalisch/primecount">Fast C++ prime counting function implementation (primecount)</a>.
%t Sort[PrimePi/@(Select[FromDigits[Reverse[IntegerDigits[ # ]]]&/@Fibonacci[Range[90]],PrimeQ])] (* _Harvey P. Dale_, Jun 02 2009 *)
%Y Cf. A036797, A036971.
%K nonn,more,base
%O 1,2
%A _N. J. A. Sloane_, _G. L. Honaker, Jr._
%E One additional term from _Harvey P. Dale_, Jun 02 2009
%E Offset corrected and a(12) added using Kim Walisch's primecount by _Amiram Eldar_, May 06 2024