%I A133772
%S A133772 1,3,3,5,5,5,3,5,7,7,9,7,7,7,9,7,7,3,5,7,7,9,9,9,7,9,11,11,13,9,9,9,11,
%T A133772 9,9,7,9,11,11,13,9,9,9,11,9,9,3,5,7,7,9,9,9,7,9,11,11,13,11,11,11,13,
               11,
%U A133772 11,7,9,11,11,13,13,13,11,13,15,15,17,11,11,11,13,11,11,9,11,13,13,15,
               11
%N A133772 Number of runs (of equal bits) in the minimal "phinary" (A130600) representation 
               of n.
%D A133772 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 A133772 Casey Mongoven, <a href="b133772.txt">Table of n, a(n) for n = 1..199</
               a>
%H A133772 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 A133772 A130600(3)=10001 because phi^2+phi^-2 = 3; 10001 has 3 runs: 1,000,1. 
               So a(3)=3.
%Y A133772 Cf. A133773, A130600.
%Y A133772 Sequence in context: A095334 A071182 A136027 this_sequence A129972 A130829 
               A035158
%Y A133772 Adjacent sequences: A133769 A133770 A133771 this_sequence A133773 A133774 
               A133775
%K A133772 nonn
%O A133772 1,2
%A A133772 Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007