Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #39 Mar 31 2012 10:30:50
%S 4,6,10,12,16,22,24,30,34,36,40,184,527,4896,11658,12874,18904,41919,
%T 45998,48504,50688,51982,356207,426851,960750,1961725,4604094,8418495,
%U 10811745,32963628,45249999,569800611,7374557947,121153257533
%N Integers n such that for all i > n the largest prime factor of i(i+1)(i+2)(i+3)(i+4)(i+5)(i+6) exceeds the largest prime factor of n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6).
%C Currently terms through a(16) = 12874 have been proved to be correct, while remaining terms are conjectural. Stormer's theorem (see link) provides an approach to proving their correctness. Such an approach should be easy for the first few terms. - Franklin T. Adams-Watters, Nov 07 2011
%H Andrey V. Kulsha, <a href="/A193948/b193948.txt">Table of n, a(n) for n = 1..39</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Stormer%27s_theorem">Stormer's theorem</a>
%Y Cf. A145606, A193947, A199407.
%K nonn
%O 1,1
%A _Andrey V. Kulsha_, Aug 10 2011