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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133771 Number of runs (of equal bits) in the maximal Lucas binary (A130311) representation of n. 1
2, 1, 1, 2, 3, 1, 3, 2, 3, 1, 4, 5, 3, 3, 2, 3, 1, 5, 4, 5, 3, 4, 5, 3, 3, 2, 3, 1, 6, 7, 5, 5, 4, 5, 3, 5, 4, 5, 3, 4, 5, 3, 3, 2, 3, 1, 7, 6, 7, 5, 6, 7, 5, 5, 4, 5, 3, 6, 7, 5, 5, 4, 5, 3, 5, 4, 5, 3, 4, 5, 3, 3, 2, 3, 1, 8, 9, 7, 7, 6, 7, 5, 7, 6, 7, 5, 6, 7, 5, 5, 4, 5, 3, 7, 6, 7, 5, 6, 7, 5, 5, 4, 5, 3, 6 (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

Table of n, a(n) for n=1..105.

Ron Knott, Using Powers of Phi to represent Integers.

EXAMPLE

A130311(19)=101110 because 11+4+3+1=19 (a sum of Lucas numbers); this representation has four runs: 1,0,111,0. So a(19)=4.

CROSSREFS

Cf. A133770, A130311.

Sequence in context: A182972 A153452 A090680 * A288158 A319522 A217612

Adjacent sequences:  A133768 A133769 A133770 * A133772 A133773 A133774

KEYWORD

nonn

AUTHOR

Casey Mongoven, Sep 23 2007; corrected Mar 23 2008

EXTENSIONS

The b-file submitted by Casey Mongoven did not match the terms of the sequence, so I have deleted it. Of course it may be that the sequence is wrong and the b-file was correct. Should be rechecked. - N. J. A. Sloane, Nov 10 2010

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 November 20 02:55 EST 2018. Contains 317370 sequences. (Running on oeis4.)