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 A073162 #23 Mar 19 2025 17:53:41
%S A073162 1,3,17,37,9107,156335,679083,1068131,4883039,101691357
%N A073162 n is such that partial sum of pi(k) from 1 to n is divisible by n.
%C A073162 a(11) > 10^12. - _Donovan Johnson_, Mar 19 2011
%C A073162 a(11) > 10^13. - _Lucas A. Brown_, Oct 05 2020
%F A073162 Solutions to Mod[A046992(x), x]=0
%e A073162 a(3) = 17 because 0+1+2+2+3+3+4+4+4+4+5+5+6+6+6+6+7 = 68 = 4*17.
%t A073162 s = 0; Do[s = s + PrimePi[n]; If[ IntegerQ[s/n], Print[{n, s, s/n}]], {n, 1, 10^8}]
%t A073162 Module[{nn=11 10^5,pspi},pspi=Accumulate[PrimePi[Range[nn]]];Select[Thread[{Range[nn],pspi}],Mod[#[[2]],#[[1]]]==0&]][[;;,1]] (* The program generates the first 8 terms of the siequence. *) (* _Harvey P. Dale_, Mar 19 2025 *)
%Y A073162 Cf. A046992, A000720, A073163, A073164, A073224.
%K A073162 nonn,more
%O A073162 1,2
%A A073162 _Labos Elemer_, Jul 18 2002
%E A073162 Edited and extended by _Robert G. Wilson v_, Jul 20 2002
%E A073162 a(10) from _Donovan Johnson_, Dec 15 2009