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 A229110 #22 Sep 25 2013 11:16:45
%S A229110 0,0,2,3,4,3,6,5,5,7,10,2,12,11,6,9,16,6,18,8,10,19,22,0,19,23,14,14,
%T A229110 28,3,30,17,18,31,22,35,36,35,22,10,40,9,42,26,12,43,46,44,41,32,30,
%U A229110 32,52,15,38,20,34,55,58,42,60,59,22,33,46,21,66,44,42
%N A229110 Sum of non-divisors of n reduced modulo n.
%C A229110 Numbers n such that a(n)=0 are: 1, 2, 24, 4320, 4680, ... (see A159907, conjecture by _Jaroslav Krizek_ and further comments). - _Michel Marcus_, Sep 23 2013
%C A229110 Numbers n such that a(n)=n/2 are: 6, 28, 120, 496, 672, ... = A007691 \ {1}. - _Michel Marcus_, Sep 25 2013
%H A229110 Jaroslav Krizek, <a href="/A229110/b229110.txt">Table of n, a(n) for n = 1..10000.</a>
%F A229110 a(n) = A024816(n) mod n.
%o A229110 (Haskell) a229110 n = mod (a024816 n) n
%o A229110 (PARI) a(n) = lift(sum(i=1, n, if (n % i, Mod(i, n), 0))); \\ _Michel Marcus_, Sep 23 2013
%o A229110 (PARI) a(n)=(n*(n+1)/2-sigma(n))%n \\ _Charles R Greathouse IV_, Sep 23 2013
%Y A229110 Cf. A024816, A054024.
%K A229110 nonn,easy
%O A229110 1,3
%A A229110 _Jaroslav Krizek_, Sep 22 2013