This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A182667 #26 Oct 18 2021 12:19:25 %S A182667 2,7,17,53,197,373,983,3803,6709,17333,43783,103681,317789,785671, %T A182667 2177321,5581493,20632861,38770357,126491971,331160281,1070825143, %U A182667 1836305137,6643521067,10749957121,32951279111,86252640919,213265164691,591286712167,2126709216773 %N A182667 Smallest prime with n terms in its Zeckendorf representation. %C A182667 Drmota, Müllner, & Spiegelhofer prove that a(n) exists for each n, see links. - _Charles R Greathouse IV_, Oct 18 2021 %H A182667 Amiram Eldar and Charles R Greathouse IV, <a href="/A182667/b182667.txt">Table of n, a(n) for n = 1..1000</a> (first 33 terms from Amiram Eldar) %H A182667 Michael Drmota, Clemens Müllner, and Lukas Spiegelhofer, <a href="https://arxiv.org/abs/2109.04068">Primes as sums of Fibonacci numbers</a>, arXiv:2109.04068 [math.NT] %F A182667 a(n) = A000040(A182561(n)). %e A182667 The smallest prime with 3 terms in its Zeckendorf representation is a(3) = 17. %e A182667 ... with 17 = Fib(7) + Fib(4) + Fib(2) = 13 + 3 + 1. - _Bernard Schott_, Oct 19 2019 %o A182667 (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 %Y A182667 Cf. A182561, A182535, A000040, A007895. %K A182667 nonn %O A182667 1,1 %A A182667 _Alex Ratushnyak_, Dec 23 2012 %E A182667 a(14)-a(29) calculated from the data of A182561 by _Amiram Eldar_, Oct 19 2019