A117479 - OEIS

This site is supported by donations to The OEIS Foundation.

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 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,8`
	REFERENCES	`J. L. Brown, A New Characterization of the Fibonacci Numbers, Fibonacci Quarterly, 3 (1965), pp. 1-8.`
	LINKS	`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 A064272 A200650 * A118404 A089339 A127284` `Adjacent sequences: A117476 A117477 A117478 * A117480 A117481 A117482`
	KEYWORD	`nonn`
	AUTHOR	`Casey Mongoven (cm(AT)caseymongoven.com), Mar 20 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.