A193948 Integers k such that for all i > k the largest prime factor of i(i+1)(i+2)(i+3)(i+4)(i+5)(i+6) exceeds the largest prime factor of k(k+1)(k+2)(k+3)(k+4)(k+5)(k+6).

4, 6, 10, 12, 16, 22, 24, 30, 34, 36, 40, 184, 527, 4896, 11658, 12874, 18904, 41919, 45998, 48504, 50688, 51982, 356207, 426851, 960750, 1961725, 4604094, 8418495, 10811745, 32963628, 45249999, 569800611, 7374557947, 121153257533

Offset: 1

Author

Andrey V. Kulsha, Aug 10 2011

Keywords

• nonn

Comments

Currently terms through a(16) = 12874 have been proved to be correct, while remaining terms are conjectural. Stormer's theorem (see link) provides an approach to proving their correctness. Such an approach should be easy for the first few terms. - Franklin T. Adams-Watters, Nov 07 2011

Links

• Andrey V. Kulsha, Table of n, a(n) for n = 1..39
• Wikipedia, Stormer's theorem

Crossrefs

Cf. A145606, A193947, A199407.