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.
%I A297893 #13 Jun 26 2018 12:08:11 %S A297893 3041,24917,144671,224251,278191,301927,726071,729173,772691,1612007, %T A297893 1822021,1954343,2001409,2157209,2451919,2465917,2522357,2668231, %U A297893 3684011,3779527,3965447,4488299,4683271,4869083,5244427,5650219,6002519,6324191,6499721,7252669 %N A297893 Numbers that divide exactly three Euclid numbers. %C A297893 A113165 lists numbers those numbers (> 1) that divide at least one Euclid number; A297891 lists those that divide exactly two Euclid numbers. %C A297893 Is this sequence infinite? %C A297893 Does this sequence contain any nonprimes? %C A297893 Are there any numbers > 1 that divide more than three Euclid numbers? %C A297893 The first numbers that divide 4 and 5 Euclid numbers are 15415223 and 2464853, respectively. - _Giovanni Resta_, Jun 26 2018 %H A297893 Giovanni Resta, <a href="/A297893/b297893.txt">Table of n, a(n) for n = 1..50</a> %e A297893 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. %Y A297893 Cf. A002110 (primorials), A006862 (Euclid numbers), A113165 (numbers > 1 that divide Euclid numbers), A297891 (numbers > 1 that divide exactly two Euclid numbers). %K A297893 nonn %O A297893 1,1 %A A297893 _Jon E. Schoenfield_, Jan 07 2018 %E A297893 a(14)-a(30) from _Giovanni Resta_, Jun 26 2018