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

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

%S 3,5,9,15,17,23,27,29,33,39,45,47,53,57,59,65,69,75,83,87,89,93,95,99,

%T 113,117,123,125,135,137,143,149,153,159,165,167,177,179,183,185,197,

%U 209,1331,1332,48504,48508,87163,416318,780357,1845848,3177027,3177029,4309597,12369422

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

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

%H Andrey V. Kulsha, <a href="/A209837/b209837.txt">Table of n, a(n) for n = 1..72</a>

%Y Cf. A200570, A209838.

%K nonn

%O 1,1

%A _Andrey V. Kulsha_, Mar 14 2012