cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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

Original entry on oeis.org

3, 5, 9, 15, 17, 23, 27, 29, 33, 39, 45, 47, 53, 57, 59, 65, 69, 75, 83, 87, 89, 93, 95, 99, 113, 117, 123, 125, 135, 137, 143, 149, 153, 159, 165, 167, 177, 179, 183, 185, 197, 209, 1331, 1332, 48504, 48508, 87163, 416318, 780357, 1845848, 3177027, 3177029, 4309597, 12369422
Offset: 1

Views

Author

Andrey V. Kulsha, Mar 14 2012

Keywords

Comments

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

Crossrefs

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

Original entry on oeis.org

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

Views

Author

Andrey V. Kulsha, Mar 14 2012

Keywords

Comments

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

Crossrefs

Cf. A209838.
Showing 1-2 of 2 results.