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 A118219 #9 Mar 15 2015 20:27:27
%S A118219 3,30,17,248,515,49682
%N A118219 Smallest number k>1 such that Sum_{i=1..k} Prime[i]^n divides Product_{i=1..k} Prime[i]^n.
%C A118219 a(7)>991430. - _Robert G. Wilson v_, Mar 02 2007
%e A118219 a(1) = 3 because 2 + 3 + 5 = 10 divides 2*3*5 = 30 but 2 + 3 = 5 does not divide 2*3 = 6.
%t A118219 f[n_] := Block[{k = 2, p = 2, s = 2^n}, While[p = p*Prime@ k; s = s + Prime@ k^n; PowerMod[p, n, s] != 0, k++ ]; k]; Do[ Print@ f@n, {n, 10}] (* _Robert G. Wilson v_ *)
%Y A118219 Cf. A051838 = Sum of first n primes divides product of first n primes. Cf. A125314 = Smallest number k>1 such that Sum_{i=1..k} i^n divides Product_{i=1..k} i^n. Cf. A007504, A002110, A024450, A098999, A122102, A122103.
%K A118219 hard,more,nonn
%O A118219 1,1
%A A118219 _Alexander Adamchuk_, Feb 24 2007
%E A118219 a(6) from _Robert G. Wilson v_, Mar 02 2007