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 A353776 #12 May 08 2022 16:46:52
%S A353776 0,1,1,1,1,4,1,3,1,4,1,7,1,4,6,3,1,7,1,8,5,4,1,14,1,4,4,10,1,14,1,7,6,
%T A353776 4,8,11,1,4,5,17,1,16,1,10,13,4,1,19,1,9,6,8,1,16,7,17,5,4,1,32,1,4,
%U A353776 13,7,9,19,1,8,6,23,1,27,1,4,10,10,12,16,1,23
%N A353776 a(n) = Sum_{d|n} (n/d mod d).
%H A353776 Antti Karttunen, <a href="/A353776/b353776.txt">Table of n, a(n) for n = 1..20000</a>
%t A353776 a[n_] := DivisorSum[n, Mod[n/#, #] &]; Array[a, 100] (* _Amiram Eldar_, May 07 2022 *)
%o A353776 (Haskell)
%o A353776 import Math.NumberTheory.ArithmeticFunctions
%o A353776 a n = sum $ map (\d -> n `quot` d `rem` d) $ divisorsList n
%o A353776 (PARI) A353776(n) = sumdiv(n,d,((n/d)%d)); \\ _Antti Karttunen_, May 08 2022
%Y A353776 Cf. A055155, A057670, A082909.
%K A353776 nonn
%O A353776 1,6
%A A353776 _Sebastian Karlsson_, May 07 2022