This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A179758 #3 Mar 31 2012 13:21:20 %S A179758 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 A179758 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 A179758 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 A179758 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 A179758 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 A179758 A. Karttunen, <a href="/A179758/b179758.txt">Table of n, a(n) for n = 1..262656 (containing 512 first rows)</a> %o A179758 (MIT Scheme:) (define (A179758 n) (modulo (floor->exact (/ (A080069 (A000194 n)) (expt 2 (A179753 n)))) 2)) %Y A179758 Cf. also A179759 & A179761-A179763. %K A179758 nonn,tabf %O A179758 1,1 %A A179758 _Antti Karttunen_, Aug 03 2010