%I A133775
%S A133775 0,2,3,2,5,5,7,6,5,5,4,8,8,8,7,8,8,11,10,9,9,8,8,8,9,8,7,7,6,11,11,11,
               10,
%T A133775 11,11,12,11,10,10,9,11,11,11,10,11,11,15,14,13,13,12,12,12,13,12,11,11,
%U A133775 10,11,11,11,10,11,11,13,12,11,11,10,10,10,11,10,9,9,8,14,14,14,13,14,
               14
%N A133775 Number of 0s in the minimal "phinary" (A130600) representation of n.
%D A133775 Zeckendorf, E., Representation des nombres naturels par une somme des 
               nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. 
               Liege 41, 179-182, 1972.
%H A133775 Casey Mongoven, <a href="b133775.txt">Table of n, a(n) for n = 1..199</
               a>
%H A133775 Ron Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
               phigits.html">Using Powers of Phi to represent Integers</a>.
%e A133775 A130600(5)=10001001, which has five 0s. So a(5)=5.
%Y A133775 Cf. A133776, A130600.
%Y A133775 Sequence in context: A074196 A153023 A068319 this_sequence A099043 A021047 
               A113649
%Y A133775 Adjacent sequences: A133772 A133773 A133774 this_sequence A133776 A133777 
               A133778
%K A133775 nonn
%O A133775 1,2
%A A133775 Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007