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 A164704 #9 May 13 2017 12:41:50 %S A164704 1,0,0,1,0,0,1,0,0,1,1,0,1,0,0,1,0,1,1,1,0,0,0,0,0,0,1,0,1,1,0,1,0,1, %T A164704 1,0,0,1,1,0,0,0,1,0,1,0,0,1,0,1,1,0,1,0,1,0,1,1,0,1,1,0,0,1,0,0,1,0, %U A164704 1,0,0,1,1,1,0,1,0,0,0,1,1,0,1,0,1,1,0,1,0,0,0,1,1,0,0,1,0,1,0,1,0,0,1,1,1 %N A164704 A006886 mod 9. %C A164704 The definition implies that if m is A006886(n) for some n, then m == m^2 mod 9, hence m == 0 or 1 mod 9, as conjectured by Paul Curtz. - _N. J. A. Sloane_, Aug 23 2009 %K A164704 nonn,base %O A164704 1,1 %A A164704 _Paul Curtz_, Aug 23 2009 %E A164704 Edited and extended by _N. J. A. Sloane_, Aug 23 2009