login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030426 a(n) = Fibonacci(prime(n)). 10
1, 2, 5, 13, 89, 233, 1597, 4181, 28657, 514229, 1346269, 24157817, 165580141, 433494437, 2971215073, 53316291173, 956722026041, 2504730781961, 44945570212853, 308061521170129, 806515533049393, 14472334024676221, 99194853094755497, 1779979416004714189 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Except for Fibonacci(4) = 3, if Fibonacci(n) is prime, then n is also prime. However, if n is prime, Fibonacci(n) might be composite, as, for example, Fibonacci(19) = 4181 = 37 * 113. - Alonso del Arte, Jan 28 2014

LINKS

T. D. Noe, Table of n, a(n) for n = 1..100

MAPLE

with(combinat); for i from 1 to 50 do fibonacci(ithprime(i)); od;

MATHEMATICA

Fibonacci[Prime[Range[30]]] (* Harvey P. Dale, Mar 25 2013 *)

PROG

(PARI) a(n)=fibonacci(prime(n)) \\ Charles R Greathouse IV, Apr 26 2012

(MAGMA) [Fibonacci(NthPrime(n)): n in [1..80]]; // Vincenzo Librandi, May 22 2015

CROSSREFS

Cf. A005478.

Sequence in context: A236395 A032015 A075736 * A075742 A075737 A100843

Adjacent sequences:  A030423 A030424 A030425 * A030427 A030428 A030429

KEYWORD

nonn,easy,nice

AUTHOR

John C. Hallyburton, Jr. (jhallyburton(AT)mx1.AspenRes.Com)

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 15:24 EST 2016. Contains 278770 sequences.