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 A200570 #17 Mar 31 2012 10:30:50
%S A200570 4,6,10,16,18,24,28,30,34,40,46,48,114,118,124,126,136,138,294,318,
%T A200570 1332,1333,48505,48509,87164,135990,416319,436744,780358,8763442,
%U A200570 25039772,35176558,44444364,61575288,100918165,846178875,1214569400,2644138052,9381631594
%N A200570 Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,12}) exceeds the largest prime factor of product(n+k, {k,0,12}).
%C A200570 Heuristics show that these terms are valid, but a strict proof is yet to be done.
%H A200570 Andrey V. Kulsha, <a href="/A200570/b200570.txt">Table of n, a(n) for n = 1..43</a>
%Y A200570 Cf. A200569, A209837.
%K A200570 nonn
%O A200570 1,1
%A A200570 _Andrey V. Kulsha_, Nov 19 2011