id:A133776 - OEIS Search Results

Search: id:A133776

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	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 this_sequence A060118 A029308 A029259` `Adjacent sequences: A133773 A133774 A133775 this_sequence A133777 A133778 A133779`
	KEYWORD	`nonn`
	AUTHOR	`Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research