%I
%S 0,0,1,0,0,1,0,1,0,1,0,0,0,1,1,0,1,0,1,0,1,0,0,1,0,0,0,1,0,0,0,1,0,1,
%T 1,1,0,0,0,1,0,0,1,1,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0,1,1,0,0,1,0,1,
%U 0,1,0,0,1,1,0,1,0,1,0,0,0,1,1,0,0,1,0,0,1,1,1,0,0,0,1,0,1,0,1,0,1,0
%N Auxiliary array for computing A153835.
%C A(x,y): A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ... is 1 if y=0 and x!=0, or if A085207bi(2*x, y) is greater than A085207bi(2*y, x), 0 otherwise.
%H A. Karttunen, <a href="/A154103/b154103.txt">Table of n, a(n) for n = 0..1274</a>
%o (MIT Scheme:)
%o (define (A154103bi x y) (cond ((and (zero? y) (not (zero? x))) 1) ((> (A085207bi (* 2 x) y) (A085207bi (* 2 y) x)) 1) (else 0)))
%o (define (A154103 n) (A154103bi (A002262 n) (A025581 n)))
%Y Transpose: A154104. Cf. A085207, A002262, A025581.
%K nonn,tabl
%O 0,1
%A _Antti Karttunen_, Jan 05 2009
