|
%I #11 Jan 09 2024 16:40:30
%S 0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0,0,0,1,1,0,
%T 1,0,0,0,1,1,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0,0,0,1,1,0,1,0,0,0,1,0,1,0,
%U 0,0,1,0,0,0,1,0,0,1,0,0,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,1,0,0,1,0,0,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,1,0,0,1,0,0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0
%N Start with a(1)=0; then a(n) = (curling number of (a(1),...,a(n-1))) mod 2.
%H <a href="/index/Ge#Gijswijt">Index entries for sequences related to Gijswijt's sequence</a>
%H <a href="/index/Cu#curling_numbers">Index entries for sequences related to curling numbers</a>
%Y Cf. A090822, A217206, A216730 (for definition of curling number).
%K nonn
%O 1
%A _N. J. A. Sloane_, following a suggestion from Russell Sutherland, Sep 28 2012
|
