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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133776 Number of 0s in the maximal "phinary" (A130601) representation of n. 2
0, 0, 1, 2, 1, 1, 3, 2, 2, 2, 4, 2, 2, 3, 2, 2, 2, 5, 4, 4, 3, 2, 3, 3, 4, 3, 3, 3, 6, 3, 3, 4, 3, 3, 3, 5, 4, 4, 3, 2, 3, 3, 4, 3, 3, 3, 7, 6, 6, 5, 4, 5, 5, 5, 4, 4, 3, 2, 4, 4, 5, 4, 4, 4, 6, 5, 5, 4, 3, 4, 4, 5, 4, 4, 4, 8, 4, 4, 5, 4, 4, 4, 6, 5, 5, 4, 3, 4, 4, 5, 4, 4, 4, 7, 6, 6, 5, 4, 5, 5, 5, 4, 4, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

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

A130601(7)=10101101, which has three 0s. So a(7)=3.

CROSSREFS

Cf. A133775, A130601.

Sequence in context: A120643 A242628 A111867 * A060118 A219032 A234567

Adjacent sequences:  A133773 A133774 A133775 * A133777 A133778 A133779

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 03:13 EST 2019. Contains 319260 sequences. (Running on oeis4.)