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 A182535 #28 Oct 19 2019 15:18:21
%S A182535 1,1,1,2,2,1,3,3,2,2,3,2,3,3,2,4,3,3,4,3,3,3,4,1,2,4,3,3,4,3,4,3,4,4,
%T A182535 2,3,2,4,3,3,3,3,3,4,5,2,5,4,5,5,1,3,2,3,3,4,3,4,4,4,4,3,5,4,5,4,4,4,
%U A182535 5,5,5,4,5,6,2,3,4,4,3,4,3,4,5,3,4,4,5,5,4,5,3,3,3,5,6,4,5,2,3,5,4,4,4,5,5
%N A182535 Number of terms in Zeckendorf representation of prime(n).
%C A182535 Alternately, the minimum number of Fibonacci numbers which sum to prime(n). - _Alan Worley_, Apr 17 2015
%H A182535 Amiram Eldar, <a href="/A182535/b182535.txt">Table of n, a(n) for n = 1..10000</a>
%F A182535 a(n) = A007895(A000040(n)).
%e A182535 prime(4)=7, and 7 is represented as 5+2, so a(4)=2.
%e A182535 prime(7)=17, and 17 is represented as 13+3+1, so a(7)=3.
%t A182535 f[n_Integer] := Block[{k = Ceiling[ Log[ GoldenRatio, n*Sqrt[5]]], t = n, fr = {}}, While[k > 1, If[t >= Fibonacci[k], AppendTo[fr, 1]; t = t - Fibonacci[k], AppendTo[fr, 0]]; k--]; Count[fr, 1]]; f@# & /@ Prime@ Range@ 105 (* _Robert G. Wilson v_, Apr 22 2015 *)
%Y A182535 Cf. A007895, A020908, A020910, A025496-A025502.
%K A182535 nonn
%O A182535 1,4
%A A182535 _Alex Ratushnyak_, May 05 2012