This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A094894 #18 Jul 10 2025 08:13:57
%S A094894 3,2,5,7,17,31,61,109,211,383,677,1217,2137,3733,6521,11279,19463,
%T A094894 33347,56963,97159,165443,280549,474809,801611,1351841,2273989,
%U A094894 3821689,6412541,10742339,17974841,30045019,50163697,83669419,139420003,232106309,386086573,641716373
%N A094894 a(n) = prime(Lucas(n)), Lucas numbers beginning at 2 (A000032).
%H A094894 Amiram Eldar, <a href="/A094894/b094894.txt">Table of n, a(n) for n = 0..82</a>
%H A094894 Paul Cooijmans, <a href="http://web.archive.org/web/20050302174449/http://members.chello.nl/p.cooijmans/gliaweb/tests/odds.html">Odds</a>.
%F A094894 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 A094894 Table[ Prime[ Fibonacci[n + 1] + Fibonacci[n - 1]], {n, 0, 35}] (* _Robert G. Wilson v_, Jun 16 2004 *)
%t A094894 Table[Prime[LucasL[n]], {n, 0, 40}] (* _Vincenzo Librandi_, Jan 14 2016 *)
%o A094894 (Magma) [NthPrime(Lucas(n)): n in [0..40]]; // _Vincenzo Librandi_, Jan 14 2016
%Y A094894 Cf. A027747, A030427, A000032, A000045, A000040.
%K A094894 nonn
%O A094894 0,1
%A A094894 _N. J. A. Sloane_, Jun 15 2004
%E A094894 More terms from _Robert G. Wilson v_, Jun 16 2004
%E A094894 a(34)-a(36) from _Vincenzo Librandi_, Jan 14 2016