login

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”).

Prime(Lucas(n)), Lucas numbers beginning at 2 (A000032).
1

%I #11 Sep 08 2022 08:45:13

%S 3,2,5,7,17,31,61,109,211,383,677,1217,2137,3733,6521,11279,19463,

%T 33347,56963,97159,165443,280549,474809,801611,1351841,2273989,

%U 3821689,6412541,10742339,17974841,30045019,50163697,83669419,139420003,232106309,386086573,641716373

%N Prime(Lucas(n)), Lucas numbers beginning at 2 (A000032).

%H Paul Cooijmans, <a href="http://web.archive.org/web/20050302174449/http://members.chello.nl/p.cooijmans/gliaweb/tests/odds.html">Odds</a>.

%F a(n) = prime(L(n)) = A000040(A000032(n)) = prime(Fib(n + 1) + Fib(n-1)), where Fib are the Fibonacci numbers(A000045) with Fib(-1) = -1.

%t Table[ Prime[ Fibonacci[n + 1] + Fibonacci[n - 1]], {n, 0, 35}] (* _Robert G. Wilson v_, Jun 16 2004 *)

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

%o (Magma) [NthPrime(Lucas(n)): n in [0..40]]; // _Vincenzo Librandi_, Jan 14 2016

%Y Cf. A027747, A030427, A000032, A000045, A000040.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_, Jun 15 2004

%E More terms from _Robert G. Wilson v_, Jun 16 2004

%E a(34)-a(36) from _Vincenzo Librandi_, Jan 14 2016