login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A209839
Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,15}) exceeds the largest prime factor of product(n+k, {k,0,15}).
2
1, 3, 7, 13, 15, 21, 25, 27, 31, 37, 43, 45, 51, 55, 57, 63, 67, 73, 81, 85, 87, 91, 93, 97, 111, 115, 121, 123, 133, 135, 141, 147, 151, 157, 163, 165, 175, 177, 181, 183, 195, 207, 211, 213, 217, 223, 225, 235, 241, 247, 253, 1330, 1383, 4179, 4180, 4181, 5243, 12985, 48506, 87161, 211750
OFFSET
1,2
COMMENTS
Heuristics show that these terms are valid, but a strict proof is yet to be done.
LINKS
CROSSREFS
Cf. A209838.
Sequence in context: A341447 A310253 A092734 * A192854 A002236 A255682
KEYWORD
nonn
AUTHOR
Andrey V. Kulsha, Mar 14 2012
STATUS
approved