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 A227008 #27 Feb 11 2021 01:25:56 %S A227008 1,399,872,1214,2090,5200,5588,21208,29152,638049,1627676,151732410, %T A227008 274845607,3224070252,54892040166,69020111756,175288968221 %N A227008 Numbers k such that Sum_{j=1..k} (sigma(j) + phi(j) + tau(j)) == 0 (mod k). %C A227008 a(17) > 10^11. - _Donovan Johnson_, Jul 07 2013 %C A227008 a(18) > 5*10^11. - _Giovanni Resta_, Jul 11 2013 %e A227008 Sum_{j=1..399} sigma(j) = 130973; %e A227008 Sum_{j=1..399} phi(j) = 48518; %e A227008 Sum_{j=1..399} tau(j) = 2453; %e A227008 (130973 + 48518 + 2453) / 399 = 456. %p A227008 with(numtheory); ListA227008:=proc(q,h) local a, n; a:=0; %p A227008 for n from 1 to q do a:=a+sigma(n)+phi(n)+tau(n); if (a mod n)=0 then print(n); fi; od; end: ListA227008(10^9); %o A227008 (PARI) s=0; for(n=1, 274845607, s=s+sigma(n)+eulerphi(n)+numdiv(n); if(s%n==0, print(n " " s))) /* _Donovan Johnson_, Jul 06 2013 */ %Y A227008 Cf. A000005, A000010, A000203. %Y A227008 Cf. A006218, A002088, A024916. %Y A227008 Cf. A233541. %K A227008 nonn,more %O A227008 1,2 %A A227008 _Paolo P. Lava_, Jun 27 2013 %E A227008 a(11)-a(14) from _Donovan Johnson_, Jul 06 2013 %E A227008 a(15)-a(16) from _Donovan Johnson_, Jul 07 2013 %E A227008 a(17) from _Giovanni Resta_, Jul 11 2013