The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A133770 Number of runs (of equal bits) in the minimal Lucas binary (A130310) representation of n. 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; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES Zeckendorf, E., Représentation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Liège 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. Sequence in context: A156995 A131183 A346063 * A288310 A332718 A341461 Adjacent sequences: A133767 A133768 A133769 * A133771 A133772 A133773 KEYWORD nonn AUTHOR Casey Mongoven, Sep 23 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 00:20 EST 2022. Contains 358698 sequences. (Running on oeis4.)