Search: id:A133771
Results 1-1 of 1 results found.

%I A133771
%S A133771 2,1,1,2,4,1,3,2,3,1,4,4,3,3,2,6,1,5,4,5,3,4,4,3,3,2,3,1,6,6,5,5,4,6,3,
%T A133771 5,4,5,3,4,4,3,3,2,8,1,7,6,7,5,6,6,5,5,4,5,3,6,6,5,5,4,6,3,5,4,5,3,4,4,
%U A133771 3,3,2,3,1,8,8,7,7,6,8,5,7,6,7,5,6,6,5,5,4,8,3,7,6,7,5,6,6,5,5,4,5,3,6
%N A133771 Number of runs (of equal bits) in the maximal Lucas binary (A130311) 
               representation of n.
%D A133771 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 A133771 Casey Mongoven, <a href="b133771.txt">Table of n, a(n) for n = 1..199</
               a>
%H A133771 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 A133771 A130311(19)=101110 because 11+4+3+1=19 (a sum of Lucas numbers); this 
               representation has four runs: 1,0,111,0. So a(19)=4.
%Y A133771 Cf. A133770, A130311.
%Y A133771 Sequence in context: A056061 A029265 A103648 this_sequence A127309 A097853 
               A160266
%Y A133771 Adjacent sequences: A133768 A133769 A133770 this_sequence A133772 A133773 
               A133774
%K A133771 nonn
%O A133771 1,1
%A A133771 Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007; corrected Mar 
               23 2008

Search completed in 0.001 seconds