|
| |
|
|
A138185
|
|
Smallest prime >= n-th Fibonacci number.
|
|
3
| |
|
|
2, 2, 2, 2, 3, 5, 11, 13, 23, 37, 59, 89, 149, 233, 379, 613, 991, 1597, 2591, 4201, 6779, 10949, 17713, 28657, 46381, 75029, 121403, 196429, 317827, 514229, 832063, 1346273, 2178313, 3524603, 5702897, 9227479, 14930387, 24157823, 39088193
(list; graph; refs; listen; history; internal format)
|
|
|
|
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 (deutsch(AT)duke.poly.edu), 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 (efriedma(AT)stetson.edu), Mar 26 2008
NextPrime/@(Fibonacci[Range[0, 50]]-1) (* From Harvey P. Dale, Nov 23 2011 *)
|
|
|
CROSSREFS
| Cf. A138184.
Sequence in context: A035635 A029100 A098133 * A138705 A114869 A078228
Adjacent sequences: A138182 A138183 A138184 * A138186 A138187 A138188
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Colm Mulcahy (colm(AT)spelman.edu), Mar 04 2008
|
|
|
EXTENSIONS
| More terms from Erich Friedman (efriedma(AT)stetson.edu) and Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 26 2008
Changed the definition of Fibonacci number to fib[0] = 0, fib[1] = 1, which is the standard definition. - Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jan 06 2009
|
| |
|
|
