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,8

Links

Table of n, a(n) for n=0..88.

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.

Example

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

Crossrefs

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

Sequence in context: A109707 A214578 A064272 * A200650 A281743 A118404

Adjacent sequences: A117476 A117477 A117478 * A117480 A117481 A117482

Keyword

nonn

Author

Casey Mongoven, Mar 20 2006

Status

approved