login
This site is supported by donations 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. 2
1, 2, 3, 4, 9, 23, 25, 1456, 1616, 3865 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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.

CROSSREFS

Cf. A000045, A119984, A083668, A093308, A075737, A001605, A006450, A005478, A001605, A030426.

Sequence in context: A014281 A086865 A192988 * A101135 A088220 A085612

Adjacent sequences:  A122531 A122532 A122533 * A122535 A122536 A122537

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 18 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.