id:A133772 - OEIS Search Results

Search: id:A133772

Displaying 1-1 of 1 results found.

page 1

Number of runs (of equal bits) in the minimal "phinary" (A130600) representation of n.

+0
2

1, 3, 3, 5, 5, 5, 3, 5, 7, 7, 9, 7, 7, 7, 9, 7, 7, 3, 5, 7, 7, 9, 9, 9, 7, 9, 11, 11, 13, 9, 9, 9, 11, 9, 9, 7, 9, 11, 11, 13, 9, 9, 9, 11, 9, 9, 3, 5, 7, 7, 9, 9, 9, 7, 9, 11, 11, 13, 11, 11, 11, 13, 11, 11, 7, 9, 11, 11, 13, 13, 13, 11, 13, 15, 15, 17, 11, 11, 11, 13, 11, 11, 9, 11, 13, 13, 15, 11 (list; graph; listen)

	OFFSET	`1,2`
	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	`A130600(3)=10001 because phi^2+phi^-2 = 3; 10001 has 3 runs: 1,000,1. So a(3)=3.`
	CROSSREFS	`Cf. A133773, A130600.` `Sequence in context: A095334 A071182 A136027 this_sequence A129972 A130829 A035158` `Adjacent sequences: A133769 A133770 A133771 this_sequence A133773 A133774 A133775`
	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