A200568 -id:A200568 - cp's OEIS frontend

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}).

1, 3, 7, 9, 13, 19, 21, 27, 31, 33, 37, 43, 49, 51, 117, 201, 527, 867, 3472, 8472, 48508, 146064, 373824, 591215, 4325170, 6629044, 6823283, 30188529, 105066156, 203403620, 203403621, 323547634, 439515072, 478478082, 585101566, 1170278794, 2809596042

Offset: 1

Andrey V. Kulsha, Nov 19 2011

nonn

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

Andrey V. Kulsha, Table of n, a(n) for n = 1..45

Cf. A200566, A200568.

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

Original entry on oeis.org

1, 5, 7, 11, 17, 19, 25, 29, 31, 35, 41, 47, 49, 115, 119, 125, 127, 137, 139, 295, 319, 1333, 1334, 3470, 8470, 48506, 85759, 87165, 416320, 721404, 2731942, 3500623, 6804174, 8763443, 18567909, 25039772, 25039773, 37980379, 162799068, 304261639, 475527535

Offset: 1

Andrey V. Kulsha, Nov 19 2011

nonn

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

Andrey V. Kulsha, Table of n, a(n) for n = 1..49

Cf. A200568, A200570.

cp's OEIS Frontend

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}).

Views

Author

Keywords

Comments

Links

Crossrefs