%I A133776
%S A133776 0,0,1,2,1,1,3,2,2,2,4,2,2,3,2,2,2,5,4,4,3,2,3,3,4,3,3,3,6,3,3,4,3,3,3,
%T A133776 5,4,4,3,2,3,3,4,3,3,3,7,6,6,5,4,5,5,5,4,4,3,2,4,4,5,4,4,4,6,5,5,4,3,4,
%U A133776 4,5,4,4,4,8,4,4,5,4,4,4,6,5,5,4,3,4,4,5,4,4,4,7,6,6,5,4,5,5,5,4,4,3,2
%N A133776 Number of 0s in the maximal "phinary" (A130601) representation of n.
%D A133776 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 A133776 Casey Mongoven, <a href="b133776.txt">Table of n, a(n) for n = 1..199</
               a>
%H A133776 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 A133776 A130601(7)=10101101, which has three 0s. So a(7)=3.
%Y A133776 Cf. A133775, A130601.
%Y A133776 Sequence in context: A131333 A120643 A111867 this_sequence A060118 A029308 
               A029259
%Y A133776 Adjacent sequences: A133773 A133774 A133775 this_sequence A133777 A133778 
               A133779
%K A133776 nonn
%O A133776 1,4
%A A133776 Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007