login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133772 Number of runs (of equal bits) in the minimal "phinary" (A130600) representation of n. 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; refs; listen; history; text; internal format)
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: A258642 A136027 A238371 * A265182 A251549 A129972

Adjacent sequences:  A133769 A133770 A133771 * A133773 A133774 A133775

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 27 11:25 EDT 2017. Contains 288788 sequences.