A117479 Number of zeros in the maximal Fibonacci bit-representation of n (A104326).

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, 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, 3, 2, 2, 2, 1, 3, 2, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 0, 4

Offset: 0

Author

Casey Mongoven, Mar 20 2006

Keywords

• nonn

Examples

			a(7) = 2 because A104326(7) = 1010 contains 2 zeros.
		

Links

• J. L. Brown, Jr., A new characterization of the Fibonacci numbers, Fibonacci Quarterly 3, no. 1 (1965) 1-8.
• Ron Knott, Using the Fibonacci numbers to represent whole numbers.

Crossrefs

Cf. A112310, A102364, A104325, A104324, A104326.