|
%I #6 May 23 2018 08:10:07
%S 0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1,
%T 0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1,
%U 0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1
%N a(n) = 0 if n in A303589, 1 if n is in A303590.
%H L. Goldberg and A. V. Fraenkel, <a href="http://www.wisdom.weizmann.ac.il/~fraenkel/Papers/Patterns.pdf">Patterns in the generalized Fibonacci word, applied to games</a>, Discrete Math., 341 2018 1675-1687. See Example 1.
%Y Cf. A247844, A303589, A303590.
%K nonn
%O 0
%A _N. J. A. Sloane_, May 23 2018
|
