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 A105827 #11 Nov 07 2017 18:31:38 %S A105827 1,3,4,7,6,4,0,7,5,2,4,4,6,0,0,7,2,7,4,2,0,4,0,4,7,2,0,0,6,0,0,7,0,6, %T A105827 0,3,6,4,0,2,2,0,4,4,6,0,0,4,1,5,0,2,6,0,0,0,0,2,4,0,6,0,0,7,4,0,4,6, %U A105827 0,0,0,3,2,2,4,4,0,0,0,2,1,6,4,0,4,4,0,4,2,2,0,0,0,0,0,4,2,3,4,1,6,0,0,2,0 %N A105827 a(n) = sigma(n) (mod 8). %H A105827 Antti Karttunen, <a href="/A105827/b105827.txt">Table of n, a(n) for n = 1..16384</a> %H A105827 <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a> %p A105827 A105827:= (n-> numtheory[sigma](n) mod 8): %p A105827 seq (A105827(n), n=1..105); # _Jani Melik_, Jan 26 2011 %o A105827 (PARI) a(n)=sigma(n)%8 %Y A105827 Cf. A000203. %Y A105827 Sequences sigma(n) mod k: A053866 (k=2), A074941 (k=3), A105824 (k=4), A105825 (k=5), A084301 (k=6), A105826 (k=7), A105827 (k=8), A105852 (k=9), A105853 (k=10). %K A105827 easy,nonn %O A105827 1,2 %A A105827 _Shyam Sunder Gupta_, May 05 2005