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 A338443 #26 Apr 21 2024 10:00:08
%S A338443 60977817398996785,105083995864811041,107473646345582881,
%T A338443 132819104923908481,145671955835893201,161802381510126721,
%U A338443 165167398073764801,206063729626916161,263076030916096321,292433912163313921,292561243007134465,337365329710615921,388219799621120545
%N A338443 Carmichael numbers with 11 prime factors.
%H A338443 Amiram Eldar, <a href="/A338443/b338443.txt">Table of n, a(n) for n = 1..10000</a> (calculated using data from Claude Goutier; terms 1..1142 from Daniel Suteu)
%H A338443 Claude Goutier, <a href="http://www-labs.iro.umontreal.ca/~goutier/OEIS/A055553/">Compressed text file carm10e22.gz containing all the Carmichael numbers up to 10^22</a>.
%H A338443 Richard Pinch, <a href="http://www.s369624816.websitehome.co.uk/rgep/cartable.html">Tables relating to Carmichael numbers</a>.
%F A338443 Equals A002997 intersect A069272.
%e A338443 60977817398996785 = 5*7*17*19*23*37*53*73*79*89*233 and 4, 6, 16, 18, 22, 36, 52, 72, 78, 88, 232 all divide 60977817398996784.
%o A338443 (PARI) is(n)={omega(n)==11&&is_A002997(n)}
%Y A338443 Cf. A002997 (Carmichael numbers).
%Y A338443 Cf. A006931 (Least Carmichael number with n prime factors).
%Y A338443 Cf. A299710 (Number of terms less than 10^n).
%Y A338443 Cf. A087788, A074379, A112428, A112429, A112430, A112431, A112432, A338442 (Carmichael numbers with 3-10 prime factors).
%K A338443 nonn
%O A338443 1,1
%A A338443 _Tim Johannes Ohrtmann_, Oct 28 2020