Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #23 Nov 05 2012 13:58:43
%S 1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,1,1,0,0,0,0,1,0,0,1,1,0,0,0,1,0,0,1,
%T 0,1,1,1,0,1,0,0,1,1,0,0,0,1,0,0,1,0,1,1,1,1,0,0,1,0,0,0,0,0,0,1,1,0,
%U 0,1,0,0,1,1,0,0,0,1,0,0,1,0,1,1,1,1,0,0
%N Binary complement of A213729.
%C It holds for all n>=1 that a(n) = A213724(A179016(n-1))-A179016(n), meaning that a(n) = 1 when the next node upwards in the infinite trunk of beanstalk sequence (A179016) is the smaller of the two possible branches from A179016(n), and 0 when it is the larger of the said branches. That is, this sequence tells whether A179016 proceeds "left" or "right" at each step.
%H Antti Karttunen, <a href="/A213728/b213728.txt">Table of n, a(n) for n = 0..2493</a>
%F a(n) = 1 - A213729(n).
%o (Scheme): (define (A213728 n) (- 1 (A213729 n)))
%o ;; Alternative definition:
%o (define (A213728v2 n) (if (zero? n) 1 (- (A213724 (A179016 (-1+ n))) (A179016 n))))
%Y Binary complement of A213729. Cf. A213730. Run lengths: A218545.
%K nonn
%O 0
%A _Antti Karttunen_, Nov 01 2012
%E Offset changed from 1 to 0 by _Antti Karttunen_, Nov 05 2012