A109180 - OEIS

%I #6 Mar 30 2012 18:54:36

%S 0,1,4,7,9,11,14,17,18,20,21,23,24,25,26,28,33,35,38,39,40,41,43,46,

%T 47,50,51,52,55,56,60,61,62,63,64,65,66,71,72,73,75,77,78,79,80,81,82,

%U 83,84,86,87,91,92,94,96,97,99,100,101,102,103,104,105,106,108,109,110,111,116

%N The set N of numbers such that each positive integer can be written in the form F + n, where F is a Fibonacci number and n in N, in an even number of ways.

%F The terms are the exponents in the expansion of 1/S read mod 2 where S = Sum_{k >= 0, k != 2} x^Fibonacci(k).

%Y Cf. A108345, A132229, A103651.

%K nonn

%O 1,3

%A _Nadia Heninger_ and _N. J. A. Sloane_, Dec 16 2007