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 A179761 #3 Mar 31 2012 13:21:20 %S A179761 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 A179761 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 A179761 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 A179761 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 A179761 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 A179761 A. Karttunen, <a href="/A179761/b179761.txt">Table of n, a(n) for n = 1..593664 (containing 768 first rows)</a> %o A179761 (MIT Scheme:) (define (A179761 n) (modulo (floor->exact (/ (A122242 (- (A000194 (+ n 6)) 2)) (expt 2 (A179753 (+ n 6))))) 2)) %Y A179761 Cf. also A179764 and A179758, A179762 & A179763. A179827-A179828. %K A179761 nonn,tabf %O A179761 1,1 %A A179761 _Antti Karttunen_, Aug 03 2010