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

%I #15 Mar 31 2012 10:30:50

%S 3,5,9,11,15,21,23,29,33,35,39,45,51,114,183,243,4895,5247,9588,12188,

%T 48503,48504,89175,179328,290783,4604093,4775623,7778968,13711516,

%U 56075700,104257956,165309438,1913253201,9905967078,17096261103,121153257533

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

%C Heuristics show that these terms are valid, but a strict proof is yet to be done.

%H Andrey V. Kulsha, <a href="/A199407/b199407.txt">Table of n, a(n) for n = 1..39</a>

%Y Cf. A193948, A200566.

%K nonn

%O 1,1

%A _Andrey V. Kulsha_, Nov 05 2011