A133776 - OEIS

This site is supported by donations to The OEIS Foundation.

A133776

Number of 0s in the maximal "phinary" (A130601) representation of n.

0, 0, 1, 2, 1, 1, 3, 2, 2, 2, 4, 2, 2, 3, 2, 2, 2, 5, 4, 4, 3, 2, 3, 3, 4, 3, 3, 3, 6, 3, 3, 4, 3, 3, 3, 5, 4, 4, 3, 2, 3, 3, 4, 3, 3, 3, 7, 6, 6, 5, 4, 5, 5, 5, 4, 4, 3, 2, 4, 4, 5, 4, 4, 4, 6, 5, 5, 4, 3, 4, 4, 5, 4, 4, 4, 8, 4, 4, 5, 4, 4, 4, 6, 5, 5, 4, 3, 4, 4, 5, 4, 4, 4, 7, 6, 6, 5, 4, 5, 5, 5, 4, 4, 3, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	REFERENCES	`Zeckendorf, E., Representation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Liege 41, 179-182, 1972.`
	LINKS	`Casey Mongoven, Table of n, a(n) for n = 1..199` `Ron Knott, Using Powers of Phi to represent Integers.`
	EXAMPLE	`A130601(7)=10101101, which has three 0s. So a(7)=3.`
	CROSSREFS	`Cf. A133775, A130601.` `Sequence in context: A131333 A120643 A111867 * A060118 A029308 A029259` `Adjacent sequences: A133773 A133774 A133775 * A133777 A133778 A133779`
	KEYWORD	`nonn`
	AUTHOR	`Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007`

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

Last modified February 15 11:25 EST 2012. Contains 205777 sequences.