OFFSET
0,1
LINKS
Harry J. Smith, Table of n, a(n) for n = 0..657
EXAMPLE
a(6) = 11 because 11 is the smallest prime not less than 8 (the 6th Fibonacci number).
MAPLE
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
MATHEMATICA
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 *)
NextPrime/@(Fibonacci[Range[0, 50]]-1) (* Harvey P. Dale, Nov 23 2011 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Colm Mulcahy, Mar 04 2008
EXTENSIONS
More terms from Erich Friedman and Emeric Deutsch, Mar 26 2008
Changed the definition of Fibonacci number to F(0) = 0, F(1) = 1, which is the standard definition. - Harry J. Smith, Jan 06 2009
STATUS
approved