A107016 Number of odd terms in Zeckendorf representation of n.

1, 0, 1, 2, 1, 2, 1, 0, 1, 0, 1, 2, 1, 2, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 0, 1, 0, 1, 2, 1, 2, 1, 0, 1, 0, 1, 2, 1, 2, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 4, 3, 4, 3, 2, 3, 2, 3, 4, 3, 4, 3, 2, 3, 2, 3, 4, 1, 2, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3

Offset: 1

Author

Reinhard Zumkeller, May 09 2005

Keywords

• nonn

Comments

a(n) = A007895(n) - A107015(n).

a(A107227(n)) = 0. - Reinhard Zumkeller, May 15 2005

Examples

			n = 77 = 55+21+1 -> a(77) = #{1, 21, 55} = 3;
n = 88 = 55+21+8+3+1 -> a(88) = #{1, 3, 21, 55} = 4;
n = 99 = 89+8+2 -> a(99) = #{89} = 1.
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
• Eric Weisstein's World of Mathematics, Zeckendorf Representation

Crossrefs

Cf. A000045.

Cf. A107224, A107225, A107226.

Cf. A035516.

Programs

Haskell

a107016 = length . filter odd . a035516_row
-- Reinhard Zumkeller, Mar 10 2013