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.

A297893 Numbers that divide exactly three Euclid numbers.

Original entry on oeis.org

3041, 24917, 144671, 224251, 278191, 301927, 726071, 729173, 772691, 1612007, 1822021, 1954343, 2001409, 2157209, 2451919, 2465917, 2522357, 2668231, 3684011, 3779527, 3965447, 4488299, 4683271, 4869083, 5244427, 5650219, 6002519, 6324191, 6499721, 7252669
Offset: 1

Views

Author

Jon E. Schoenfield, Jan 07 2018

Keywords

Comments

A113165 lists numbers those numbers (> 1) that divide at least one Euclid number; A297891 lists those that divide exactly two Euclid numbers.
Is this sequence infinite?
Does this sequence contain any nonprimes?
Are there any numbers > 1 that divide more than three Euclid numbers?
The first numbers that divide 4 and 5 Euclid numbers are 15415223 and 2464853, respectively. - Giovanni Resta, Jun 26 2018

Examples

			a(1) = 3041 because 3041 is the smallest number that divides exactly three Euclid numbers: 1 + A002110(206), 1 + A002110(263), and 1 + A002110(409); these numbers have 532, 712, and 1201 digits, respectively.
		

Crossrefs

Cf. A002110 (primorials), A006862 (Euclid numbers), A113165 (numbers > 1 that divide Euclid numbers), A297891 (numbers > 1 that divide exactly two Euclid numbers).

Extensions

a(14)-a(30) from Giovanni Resta, Jun 26 2018