OFFSET
1,1
COMMENTS
Drmota, Müllner, & Spiegelhofer prove that a(n) exists for each n, see links. - Charles R Greathouse IV, Oct 18 2021
LINKS
Amiram Eldar and Charles R Greathouse IV, Table of n, a(n) for n = 1..1000 (first 33 terms from Amiram Eldar)
Michael Drmota, Clemens Müllner, and Lukas Spiegelhofer, Primes as sums of Fibonacci numbers, arXiv:2109.04068 [math.NT]
EXAMPLE
The smallest prime with 3 terms in its Zeckendorf representation is a(3) = 17.
... with 17 = Fib(7) + Fib(4) + Fib(2) = 13 + 3 + 1. - Bernard Schott, Oct 19 2019
PROG
(PARI) a(n)=my(b=oo, k); while(b==oo, k++; forvec(v=vector(n, i, [1, n+k]), my(t=sum(i=1, n, fibonacci(i+v[i]))); if(t<b && isprime(t), b=t), 2)); b \\ Charles R Greathouse IV, Sep 21 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Dec 23 2012
EXTENSIONS
a(14)-a(29) calculated from the data of A182561 by Amiram Eldar, Oct 19 2019
STATUS
approved