%I
%S 1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,1,1,0,0,1,0,1,0,0,1,1,1,0,1,0,1,0,0,1,
%T 0,0,1,1,1,0,1,0,0,1,1,1,0,0,0,0,1,1,1,1,0,0,1,0,1,0,0,1,1,0,0,0,1,1,
%U 1,1,0,0,1,0,0,1,0,1,1,1,0,0,0,0,1,1,1,0,1,1,0,0,1,0,1,0,0,1,0,1,1,0
%N Binary expansions of A122242 (A122243) concatenated together to a single binary sequence, so that from each term of A122242, the most significant bits come before the least significant bits.
%C When viewed as a table, the first row contains six terms, the second eight, the third ten, and so on, i.e. row n contains 2(n+2) terms.
%H A. Karttunen, <a href="/A179761/b179761.txt">Table of n, a(n) for n = 1..593664 (containing 768 first rows)</a>
%o (MIT Scheme:) (define (A179761 n) (modulo (floor>exact (/ (A122242 ( (A000194 (+ n 6)) 2)) (expt 2 (A179753 (+ n 6))))) 2))
%Y Cf. also A179764 and A179758, A179762 & A179763. A179827A179828.
%K nonn,tabf
%O 1,1
%A _Antti Karttunen_, Aug 03 2010
