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 A125314 #6 Mar 14 2015 16:32:22
%S A125314 3,7,3,31,13,1556,733,89037,1441,668073
%N A125314 Smallest number k>1 such that Sum_{i=1..k} i^n divides Product_{i=1..k} i^n.
%C A125314 Sum[ i^n, {i,1,k} ] = Zeta[ -n ] - Zeta[ -n, k+1 ]. Product[ i^n, {i,1,k} ] = (k!)^n.
%C A125314 a(11) > 1091730. - _Robert G. Wilson v_, Jan 25 2007
%t A125314 f[n_] := Block[{k = 2, p = s = 1}, While[p = p*k; s = s + k^n; PowerMod[p, n, s] != 0, k++ ]; k]; (* _Robert G. Wilson v_ *)
%K A125314 hard,more,nonn
%O A125314 1,1
%A A125314 _Alexander Adamchuk_, Jan 18 2007
%E A125314 a(8)-a(10) from _Robert G. Wilson v_, Jan 25 2007