%I A117479
%S A117479 1,0,1,0,1,1,0,2,1,1,1,0,2,2,1,2,1,1,1,0,3,2,2,2,1,2,2,1,2,1,1,1,0,3,3,
%T A117479 2,3,2,2,2,1,3,2,2,2,1,2,2,1,2,1,1,1,0,4,3,3,3,2,3,3,2,3,2,2,2,1,3,3,2,
%U A117479 3,2,2,2,1,3,2,2,2,1,2,2,1,2,1,1,1,0,4
%N A117479 Number of zeros in the maximal Fibonacci bit-representation of n (A104326).
%D A117479 J. L. Brown, A New Characterization of the Fibonacci Numbers, Fibonacci 
               Quarterly, 3 (1965), pp. 1-8.
%H A117479 Ron Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
               fibrep.html">Using the Fibonacci numbers to represent whole numbers</
               a>.
%e A117479 a(7) = 2 because A104326(7) = 1010 contains 2 zeros.
%Y A117479 Cf. A112310, A102364, A104325, A104324, A104326.
%Y A117479 Sequence in context: A135936 A109707 A064272 this_sequence A118404 A089339 
               A127284
%Y A117479 Adjacent sequences: A117476 A117477 A117478 this_sequence A117480 A117481 
               A117482
%K A117479 nonn
%O A117479 0,8
%A A117479 Casey Mongoven (cm(AT)caseymongoven.com), Mar 20 2006