id:A133771 - OEIS Search Results

Search: id:A133771

Displaying 1-1 of 1 results found.

page 1

Number of runs (of equal bits) in the maximal Lucas binary (A130311) representation of n.

+0
2

2, 1, 1, 2, 4, 1, 3, 2, 3, 1, 4, 4, 3, 3, 2, 6, 1, 5, 4, 5, 3, 4, 4, 3, 3, 2, 3, 1, 6, 6, 5, 5, 4, 6, 3, 5, 4, 5, 3, 4, 4, 3, 3, 2, 8, 1, 7, 6, 7, 5, 6, 6, 5, 5, 4, 5, 3, 6, 6, 5, 5, 4, 6, 3, 5, 4, 5, 3, 4, 4, 3, 3, 2, 3, 1, 8, 8, 7, 7, 6, 8, 5, 7, 6, 7, 5, 6, 6, 5, 5, 4, 8, 3, 7, 6, 7, 5, 6, 6, 5, 5, 4, 5, 3, 6 (list; graph; listen)

	OFFSET	`1,1`
	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	`A130311(19)=101110 because 11+4+3+1=19 (a sum of Lucas numbers); this representation has four runs: 1,0,111,0. So a(19)=4.`
	CROSSREFS	`Cf. A133770, A130311.` `Adjacent sequences: A133768 A133769 A133770 this_sequence A133772 A133773 A133774` `Sequence in context: A056061 A029265 A103648 this_sequence A127309 A097853 A023504`
	KEYWORD	`nonn`
	AUTHOR	`Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007; corrected Mar 23 2008`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research