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 A200566 #12 Mar 31 2012 10:30:50
%S A200566 2,4,8,10,14,20,22,28,32,34,38,44,50,52,182,242,284,528,868,5246,8473,
%T A200566 8784,48503,48509,146065,438122,591216,1312724,4325171,6629045,
%U A200566 6823284,56075700,154392832,248932942,251237694,1913253200,3123337916,3180792660
%N A200566 Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,8}) exceeds the largest prime factor of product(n+k, {k,0,8}).
%C A200566 Heuristics show that these terms are valid, but a strict proof is yet to be done.
%H A200566 Andrey V. Kulsha, <a href="/A200566/b200566.txt">Table of n, a(n) for n = 1..48</a>
%Y A200566 Cf. A199407, A200567.
%K A200566 nonn
%O A200566 1,1
%A A200566 _Andrey V. Kulsha_, Nov 19 2011