A138183 Smallest Fibonacci number not less than the n-th prime.

2, 3, 5, 8, 13, 13, 21, 21, 34, 34, 34, 55, 55, 55, 55, 55, 89, 89, 89, 89, 89, 89, 89, 89, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 233, 377, 377

Offset: 1

Author

Colm Mulcahy, Mar 04 2008

Keywords

• easy
• nonn

Examples

			a(4) = 8 because the 8 is the smallest Fibonacci number not less than 7 (the 4th prime).
		

Crossrefs

Cf. A138182, A138185.

Programs

Mathematica

With[{fibs=Fibonacci[Range[20]]},Table[SelectFirst[fibs,#>=n&],{n,Prime[ Range[60]]}]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Apr 22 2018 *)

PARI

a(n) = {p = prime(n); i = 0; until ((f = fibonacci(i)) >= p, i++); f;} \\ Michel Marcus, Aug 31 2013