login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122534 Numbers n such that Fibonacci(prime(prime(n))) is prime. 4

%I #29 Oct 01 2017 07:55:07

%S 1,2,3,4,9,23,25,1456,1616,3865

%N Numbers n such that Fibonacci(prime(prime(n))) is prime.

%C a(n) are perfect squares for n = {1,4,5,7,...}. a(8) and a(9) are divisible by 16 = 2^4. Corresponding Fibonacci primes Fibonacci[Prime[Prime[a(n)]]] = {2,5,89,1597,99194853094755497,...} that is a subset of A093308[n]. Corresponding prime indices of Fibonacci primes Prime[Prime[a(n)]] = (3,5,11,17,83,431,509,130021,148091,433781,...}. Corresponding prime indices Prime[a(n)] = {2,3,5,7,23,83,97,12161,13681,36467,...} that are the primes in A119984[n] Numbers n such that Fibonacci[Prime[n]] is prime.

%F a(n) = PrimePi(A277575(n)) = PrimePi(PrimePi(A277284(n))). - _Bobby Jacobs_, Oct 26 2016

%Y Cf. A000040, A000045, A119984, A083668, A093308, A075737, A001605, A006450, A005478, A030426, A277284, A277575.

%K hard,more,nonn

%O 1,2

%A _Alexander Adamchuk_, Sep 18 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)