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 A200569 #11 Mar 31 2012 10:30:50
%S A200569 1,5,7,11,17,19,25,29,31,35,41,47,49,115,119,125,127,137,139,295,319,
%T A200569 1333,1334,3470,8470,48506,85759,87165,416320,721404,2731942,3500623,
%U A200569 6804174,8763443,18567909,25039772,25039773,37980379,162799068,304261639,475527535
%N A200569 Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,11}) exceeds the largest prime factor of product(n+k, {k,0,11}).
%C A200569 Heuristics show that these terms are valid, but a strict proof is yet to be done.
%H A200569 Andrey V. Kulsha, <a href="/A200569/b200569.txt">Table of n, a(n) for n = 1..49</a>
%Y A200569 Cf. A200568, A200570.
%K A200569 nonn
%O A200569 1,2
%A A200569 _Andrey V. Kulsha_, Nov 19 2011