login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200567 Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,9}) exceeds the largest prime factor of product(n+k, {k,0,9}). 3

%I

%S 1,3,7,9,13,19,21,27,31,33,37,43,49,51,117,201,527,867,3472,8472,

%T 48508,146064,373824,591215,4325170,6629044,6823283,30188529,

%U 105066156,203403620,203403621,323547634,439515072,478478082,585101566,1170278794,2809596042

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

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

%H Andrey V. Kulsha, <a href="/A200567/b200567.txt">Table of n, a(n) for n = 1..45</a>

%Y Cf. A200566, A200568.

%K nonn

%O 1,2

%A _Andrey V. Kulsha_, Nov 19 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 24 17:29 EST 2020. Contains 332209 sequences. (Running on oeis4.)