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 A200567 #11 Mar 31 2012 10:30:50
%S A200567 1,3,7,9,13,19,21,27,31,33,37,43,49,51,117,201,527,867,3472,8472,
%T A200567 48508,146064,373824,591215,4325170,6629044,6823283,30188529,
%U A200567 105066156,203403620,203403621,323547634,439515072,478478082,585101566,1170278794,2809596042
%N A200567 Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,9}) exceeds the largest prime factor of product(n+k, {k,0,9}).
%C A200567 Heuristics show that these terms are valid, but a strict proof is yet to be done.
%H A200567 Andrey V. Kulsha, <a href="/A200567/b200567.txt">Table of n, a(n) for n = 1..45</a>
%Y A200567 Cf. A200566, A200568.
%K A200567 nonn
%O A200567 1,2
%A A200567 _Andrey V. Kulsha_, Nov 19 2011