|
%I #3 Mar 31 2012 13:21:20
%S 1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,1,1,0,0,1,0,0,1,0,1,1,
%T 0,0,1,1,0,1,0,0,1,0,1,1,1,0,0,1,0,0,1,1,0,0,1,0,1,1,1,0,0,1,1,0,1,0,
%U 0,0,1,0,1,0,1,1,1,0,0,1,1,0,1,0,0,1,1,0,0,0,1,0,1,1,0,0,1,1,1,0,1,0
%N Binary expansions of A080069 (A080070) concatenated together to a single binary sequence, so that from each term of A080069, the most significant bits come before the least significant bits.
%C When viewed as a table, the first row contains two terms, the second four, the third six, and so on, i.e. row n contains 2n terms.
%H A. Karttunen, <a href="/A179758/b179758.txt">Table of n, a(n) for n = 1..262656 (containing 512 first rows)</a>
%o (MIT Scheme:) (define (A179758 n) (modulo (floor->exact (/ (A080069 (A000194 n)) (expt 2 (A179753 n)))) 2))
%Y Cf. also A179759 & A179761-A179763.
%K nonn,tabf
%O 1,1
%A _Antti Karttunen_, Aug 03 2010
|
