KöMaL 2012 B4471

Find those polynomial functions of integer coefficients that assign a positive prime number to every Fibonacci number. (The sequence $F_n$ of Fibonacci numbers is defined by the recurrence relation $F_n$=$F_{n-1}$+$F_{n-2}$ with seed values $F_0$=0, $F_1$=1.)