The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A165277 Number of odd-indexed Fibonacci numbers in the Zeckendorf representation of n. 6
 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 2, 3, 0, 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 2, 1, 1, 2, 2, 3, 2, 2, 3, 3, 4, 0, 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 2, 3, 0, 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 2, 1, 1, 2, 2, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 COMMENTS We begin the indexing at 2; that is, 1=F(2), 2=F(3), 3=F(4), 5=F(5), ... For a count of even-indexed Fibonacci summands, see A165276. LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 EXAMPLE 6 = 5 + 1 = F(5) + F(2), so that a(6) = 1. MATHEMATICA fibOddCount[n_] := Plus @@ (Reverse@IntegerDigits[n, 2])[[2 ;; -1 ;; 2]]; fibOddCount /@ Select[Range[1000], BitAnd[#, 2 #] == 0 &] (* Amiram Eldar, Jan 20 2020 *) CROSSREFS Cf. A014417, A165276, A165278, A165279. Sequence in context: A081603 A273513 A330005 * A245194 A215020 A103612 Adjacent sequences:  A165274 A165275 A165276 * A165278 A165279 A165280 KEYWORD nonn AUTHOR Clark Kimberling, Sep 12 2009 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 April 10 22:30 EDT 2021. Contains 342856 sequences. (Running on oeis4.)