This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A133773 Number of runs (of equal bits) in the maximal "phinary" (A130601) representation of n. 2
 1, 1, 3, 5, 3, 3, 7, 5, 5, 5, 9, 5, 5, 7, 5, 5, 5, 11, 9, 9, 7, 5, 7, 7, 9, 7, 7, 7, 13, 7, 7, 9, 7, 7, 7, 11, 9, 9, 7, 5, 7, 7, 9, 7, 7, 7, 15, 13, 13, 11, 9, 11, 11, 11, 9, 9, 7, 5, 9, 9, 11, 9, 9, 9, 13, 11, 11, 9, 7, 9, 9, 11, 9, 9, 9, 17, 9, 9, 11, 9, 9, 9, 13, 11, 11, 9, 7, 9, 9, 11, 9, 9, 9, 15, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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. Casey Mongoven, Music based on this sequence. EXAMPLE A130601(3)=1101 because phi^1 + phi^0 + phi^-2 = 3; 1101 has 3 runs: 11,0,1. So a(3)=3. CROSSREFS Cf. A133772, A130601. Sequence in context: A073703 A175019 A097519 * A077934 A077950 A077973 Adjacent sequences:  A133770 A133771 A133772 * A133774 A133775 A133776 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 16:17 EDT 2019. Contains 328223 sequences. (Running on oeis4.)