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 A126001 #10 Oct 22 2018 12:45:07 %S A126001 0,1,4,5,8,9,12,13,16,17,20,21,24,25,28,29,64,65,68,69,72,73,76,77,80, %T A126001 81,84,85,88,89,92,93,128,129,132,133,136,137,140,141,144,145,148,149, %U A126001 152,153,156,157,192,193,196,197,200,201,204,205,208,209,212,213,216 %N A126001 A106486-encodings of nonnegative combinatorial games, i.e., games whose value is >= 0. %C A126001 In these games, the left can always win if he is to play second. %H A126001 Antti Karttunen, <a href="/A126001/b126001.txt">Table of n, a(n) for n = 1..16386</a> %H A126001 A. Karttunen, <a href="/A126000/a126000.scm.txt">Scheme-program for computing this sequence.</a> %o A126001 (PARI) %o A126001 A320006(n) = if(!n,1,my(m=(n>>1), r=0); while(m>0, if((m%2)&&!A320007(r),return(0)); m >>= 2; r++); (1)); %o A126001 A320007(n) = if(!n,0,my(m=n, s=0); while(m>0, if((m%2)&&A320006(s),return(1)); m >>= 2; s++); (0)); %o A126001 k=0; n=0; while(k<16386, if(A320006(n), k++; write("b126001.txt", k, " ", n)); n++); %Y A126001 Characteristic function (A320006) occurs as row 0 of A125999. %Y A126001 Cf. A125991, A126003, A126004, A126005. %K A126001 nonn %O A126001 1,3 %A A126001 _Antti Karttunen_, Dec 18 2006