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 A160550 #12 Sep 08 2022 08:45:45
%S A160550 0,1,1,0,1,2,1,3,1,0,1,4,1,2,1,0,1,3,1,4,3,2,1,4,0,0,1,4,1,2,1,1,3,0,
%T A160550 1,1,1,2,1,2,1,6,1,4,3,2,1,6,2,1,1,4,1,2,1,0,3,0,1,0,1,2,5,0,3,6,1,4,
%U A160550 3,2,1,3,1,0,1,4,3,2,1,6,0,0,1,8,3,2,1,4,1,0,1,4,3,2,1,0,1,1,3,0,1,2,1,2,7
%N A160550 a(n) = A001065(n) mod A000005(n).
%C A160550 A054022(n) for n > 1 gives the numbers k such that a(k) = 1.
%H A160550 Antti Karttunen, <a href="/A160550/b160550.txt">Table of n, a(n) for n = 1..16384</a>
%t A160550 Table[Mod[DivisorSigma[1,n]-n,DivisorSigma[0,n]],{n,110}] (* _Harvey P. Dale_, Jun 22 2013 *)
%o A160550 (Magma) [ (SumOfDivisors(n)-n) mod NumberOfDivisors(n): n in [1..105] ]; // _Klaus Brockhaus_, May 21 2009
%o A160550 (PARI) A160550(n)=lift(Mod(sigma(n)-n,numdiv(n))); \\ _Michael B. Porter_, Oct 13 2009
%Y A160550 Cf. A000203, A000027, A000005, A054022, A001065, A003601, A140480.
%K A160550 easy,nonn
%O A160550 1,6
%A A160550 _Ctibor O. Zizka_, May 19 2009
%E A160550 Extended and comment edited by _Klaus Brockhaus_, May 21 2009