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 A141710 #13 Jun 24 2019 09:22:08
%S A141710 3,5,7,5,7,7,7,5,7,13,7,13,7,3,7,11,7,13,7,17,7,7,41,5,37,13,19,13,31,
%T A141710 41,5,37,31,13,13,3,11,7,7,5,7,11,7,19,7,5,7,43,31,37,17,23,7,31,41,
%U A141710 11,19,17,13,53,5,7,11,43,13,5,29,5,101,53,7,13,11,7,19,31,41,13,29,31,5
%N A141710 Least prime factor of n-th Carmichael number A002997(n).
%C A141710 All terms of this sequence are odd primes. See A002997 for references.
%H A141710 Amiram Eldar, <a href="/A141710/b141710.txt">Table of n, a(n) for n = 1..10000</a>
%H A141710 <a href="/index/Ca#Carmichael">OEIS index entries for Carmichael numbers</a>
%F A141710 a(n) = A020639(A002997(n))
%e A141710 a(1)=3 since A002997(1)=3*11*17.
%t A141710 CarmichaelQ[n_] := Not[PrimeQ[n]] && Divisible[n - 1, CarmichaelLambda[n]]; FactorInteger[#][[1, 1]]& /@ Select[Range[4, 10^7], CarmichaelQ] (* _Jean-François Alcover_, Sep 23 2011 *)
%o A141710 (PARI) A141710(n)=vecmin(factor(A002997(n))[,1]) /* where A002997(n) can be defined as follows: */ system("wget b002997.txt; sed -e 's/^[0-9]*//' <b002997.txt >b002997.gp"); A2997=readvec("b002997.gp"); A002997(n)=A2997[n]; \
%Y A141710 Cf. A002997, A020639, A081702, A135717.
%K A141710 nonn
%O A141710 1,1
%A A141710 _M. F. Hasler_, Jul 01 2008