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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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., 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.

Sequence in context: A225530 A020475 A131183 * A184199 A262346 A242560

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 19:19 EST 2016. Contains 278770 sequences.