A138185 - OEIS

%I #17 Dec 20 2015 00:15:47

%S 2,2,2,2,3,5,11,13,23,37,59,89,149,233,379,613,991,1597,2591,4201,

%T 6779,10949,17713,28657,46381,75029,121403,196429,317827,514229,

%U 832063,1346273,2178313,3524603,5702897,9227479,14930387,24157823,39088193

%N Smallest prime >= n-th Fibonacci number.

%H Harry J. Smith, <a href="/A138185/b138185.txt">Table of n, a(n) for n = 0..657</a>

%e a(6) = 11 because 11 is the smallest prime not less than 8 (the 6th Fibonacci number).

%p with(combinat): a:=proc(n) if isprime(fibonacci(n))=true then fibonacci(n) else nextprime(fibonacci(n)) end if end proc: seq(a(n),n=0..35); # _Emeric Deutsch_, Mar 31 2008

%t fib[0] = 0; fib[1] = 1; fib[n_] := fib[n] = fib[n - 1] + fib[n - 2] nextprime[n_] := Module[{k = n},While[Not[PrimeQ[k]], k++ ]; k] Table[nextprime[fib[n]], {n, 0, 50}] (* _Erich Friedman_, Mar 26 2008 *)

%t NextPrime/@(Fibonacci[Range[0,50]]-1) (* _Harvey P. Dale_, Nov 23 2011 *)

%Y Cf. A138184.

%K easy,nonn

%O 0,1

%A _Colm Mulcahy_, Mar 04 2008

%E More terms from _Erich Friedman_ and _Emeric Deutsch_, Mar 26 2008

%E Changed the definition of Fibonacci number to F(0) = 0, F(1) = 1, which is the standard definition. - _Harry J. Smith_, Jan 06 2009