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 A179763 #3 Mar 31 2012 13:21:20 %S A179763 1,1,1,0,0,0,1,1,1,0,0,1,0,0,1,1,1,0,1,0,0,1,0,0,1,1,1,0,1,0,0,1,1,0, %T A179763 0,0,1,1,1,1,0,0,1,0,0,1,1,0,0,0,1,1,1,1,0,0,1,0,0,1,0,1,1,0,0,0,1,1, %U A179763 1,0,1,1,0,0,1,0,0,1,0,1,1,0,0,0,1,1,1,0,1,1,0,0,1,0,0,1,1,0,1,1,0,0 %N A179763 Binary expansions of A179757 concatenated together to a single binary sequence, so that from each term of A179757, the most significant bits come before the least significant bits. %C A179763 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 A179763 A. Karttunen, <a href="/A179763/b179763.txt">Table of n, a(n) for n = 1..593664 (containing 768 first rows)</a> %o A179763 (MIT Scheme:) (define (A179763 n) (modulo (floor->exact (/ (A179757 (- (A000194 (+ n 6)) 2)) (expt 2 (A179753 (+ n 6))))) 2)) %Y A179763 Cf. also A179766 and A179758, A179761 & A179762. A179828-A179829. %K A179763 nonn,tabf %O A179763 1,1 %A A179763 _Antti Karttunen_, Aug 03 2010