id:A133770 - OEIS Search Results

Search: id:A133770

Displaying 1-1 of 1 results found.

page 1

Number of runs (of equal bits) in the minimal Lucas binary (A130310) representation of n.

+0
2

2, 1, 2, 2, 4, 3, 2, 4, 3, 4, 2, 4, 3, 4, 4, 6, 5, 2, 4, 3, 4, 4, 6, 5, 4, 6, 5, 6, 2, 4, 3, 4, 4, 6, 5, 4, 6, 5, 6, 4, 6, 5, 6, 6, 8, 7, 2, 4, 3, 4, 4, 6, 5, 4, 6, 5, 6, 4, 6, 5, 6, 6, 8, 7, 4, 6, 5, 6, 6, 8, 7, 6, 8, 7, 8, 2, 4, 3, 4, 4, 6, 5, 4, 6, 5, 6, 4, 6, 5, 6, 6, 8, 7, 4, 6, 5, 6, 6, 8, 7, 6, 8, 7, 8, 4 (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	`A130310(17)=101001 because 11+4+2=17 (a sum of Lucas numbers); this representation has five runs: 1,0,1,00,1. So a(17)=5.`
	CROSSREFS	`Cf. A133771, A130310.` `Adjacent sequences: A133767 A133768 A133769 this_sequence A133771 A133772 A133773` `Sequence in context: A102722 A020475 A131183 this_sequence A117193 A026832 A089408`
	KEYWORD	`nonn`
	AUTHOR	`Casey Mongoven (cm(AT)caseymongoven.com), Sep 23 2007`

page 1

Search completed in 0.002 seconds

Last modified July 3 11:28 EDT 2009. Contains 160562 sequences.

AT&T Labs Research