|
%I #7 Jul 07 2016 23:54:49
%S 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,
%T 3,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,
%U 3,2,3,2,2,2,1,3,2,2,2,1,2,2,1,2,1,1,1,0,4
%N Number of zeros in the maximal Fibonacci bit-representation of n (A104326).
%H J. L. Brown, Jr., <a href="http://www.fq.math.ca/Scanned/3-1/brown.pdf">A new characterization of the Fibonacci numbers</a>, Fibonacci Quarterly 3, no. 1 (1965) 1-8.
%H Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibrep.html">Using the Fibonacci numbers to represent whole numbers</a>.
%e a(7) = 2 because A104326(7) = 1010 contains 2 zeros.
%Y Cf. A112310, A102364, A104325, A104324, A104326.
%K nonn
%O 0,8
%A _Casey Mongoven_, Mar 20 2006
|
