cp's OEIS Frontend

A200568 Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,10}) exceeds the largest prime factor of product(n+k, {k,0,10}).

%I A200568 #11 Mar 31 2012 10:30:50
%S A200568 2,6,8,12,18,20,26,30,32,36,42,48,50,116,200,212,296,320,527,3471,
%T A200568 8471,48507,85760,104661,283968,1487448,2982728,3500623,6748298,
%U A200568 6804175,11135837,11421278,18567910,25039773,31512846,203403620,1170278793,2809596041
%N A200568 Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,10}) exceeds the largest prime factor of product(n+k, {k,0,10}).
%C A200568 Heuristics show that these terms are valid, but a strict proof is yet to be done.
%H A200568 Andrey V. Kulsha, <a href="/A200568/b200568.txt">Table of n, a(n) for n = 1..44</a>
%Y A200568 Cf. A200567, A200569.
%K A200568 nonn
%O A200568 1,1
%A A200568 _Andrey V. Kulsha_, Nov 19 2011