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!)
A030427 a(n) = prime(Fibonacci(n)). 6

%I

%S 2,2,3,5,11,19,41,73,139,257,461,827,1471,2591,4493,7793,13469,23159,

%T 39779,67931,115831,196687,333233,563987,951557,1603489,2696663,

%U 4528949,7594771,12717703,21275491,35548193,59328161,98921051,164781961,274253209,456074711

%N a(n) = prime(Fibonacci(n)).

%H T. D. Noe, <a href="/A030427/b030427.txt">Table of n, a(n) for n = 1..60</a>

%F a(n) = A000040(A000045(n)). - _Michel Marcus_, Jan 14 2016

%t Prime@Fibonacci@Range@50 (* _Vladimir Joseph Stephan Orlovsky_, Apr 11 2011 *)

%t Table[Prime[Fibonacci[n]], {n, 40}] (* _Vincenzo Librandi_, Jan 14 2016 *)

%o (MAGMA) [NthPrime(Fibonacci(n)): n in [1..43]]; // _Joerg Arndt_, Apr 03 2011

%o (PARI) a(n)=prime(fibonacci(n)) \\ _Charles R Greathouse IV_, Apr 29 2015

%Y Cf. A000040, A000045.

%K nonn,nice

%O 1,1

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

%E More terms from _Jud McCranie_

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 09:15 EST 2016. Contains 278762 sequences.