%I A133770
%S A133770 2,1,2,2,4,3,2,4,3,4,2,4,3,4,4,6,5,2,4,3,4,4,6,5,4,6,5,6,2,4,3,4,4,6,5,
%T A133770 4,6,5,6,4,6,5,6,6,8,7,2,4,3,4,4,6,5,4,6,5,6,4,6,5,6,6,8,7,4,6,5,6,6,8,
%U A133770 7,6,8,7,8,2,4,3,4,4,6,5,4,6,5,6,4,6,5,6,6,8,7,4,6,5,6,6,8,7,6,8,7,8,4
%N A133770 Number of runs (of equal bits) in the minimal Lucas binary (A130310) 
               representation of n.
%D A133770 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 A133770 Casey Mongoven, <a href="b133770.txt">Table of n, a(n) for n = 1..199</
               a>
%H A133770 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 A133770 A130310(17)=101001 because 11+4+2=17 (a sum of Lucas numbers); this representation 
               has five runs: 1,0,1,00,1. So a(17)=5.
%Y A133770 Cf. A133771, A130310.
%Y A133770 Sequence in context: A102722 A020475 A131183 this_sequence A163373 A117193 
               A026832
%Y A133770 Adjacent sequences: A133767 A133768 A133769 this_sequence A133771 A133772 
               A133773
%K A133770 nonn
%O A133770 1,1
%A A133770 Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007