|
%I #7 Mar 31 2012 10:30:50
%S 2,4,8,14,16,22,26,28,32,38,44,46,52,56,58,64,68,74,82,86,88,92,94,98,
%T 112,116,122,124,134,136,142,148,152,158,164,166,176,178,182,184,196,
%U 208,1330,1331,48503,48507,87162,211751,279366,1845847,3177028,4309596,4363994,9034134,61575286
%N Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,14}) exceeds the largest prime factor of product(n+k, {k,0,14}).
%C Heuristics show that these terms are valid, but a strict proof is yet to be done.
%H Andrey V. Kulsha, <a href="/A209838/b209838.txt">Table of n, a(n) for n = 1..70</a>
%Y Cf. A209837, A209839.
%K nonn
%O 1,1
%A _Andrey V. Kulsha_, Mar 14 2012
|
