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 A217719 #27 Nov 22 2019 03:38:26
%S A217719 989,3239,5777,10877,27971,29681,30739,31631,39059,72389,73919,75077,
%T A217719 100127,113573,125249,137549,137801,153931,155819,161027,162133,
%U A217719 189419,218321,231703,249331,370229,429479,430127,459191,473891,480689,600059,621781,632249,635627
%N A217719 Extra strong Lucas pseudoprimes.
%H A217719 Amiram Eldar, <a href="/A217719/b217719.txt">Table of n, a(n) for n = 1..10000</a> (from Dana Jacobsen's site)
%H A217719 Robert Baillie, <a href="/A217719/a217719.txt">Mathematica code for extra strong Lucas pseudoprimes</a>
%H A217719 Jon Grantham, <a href="http://dx.doi.org/10.1090/S0025-5718-00-01197-2">Frobenius Pseudoprimes</a>, Mathematics of Computation, 7 (2000), 873-891.
%H A217719 Dana Jacobsen, <a href="http://ntheory.org/pseudoprimes.html">Pseudoprime Statistics, Tables, and Data</a>
%o A217719 (Perl) use ntheory ":all"; foroddcomposites { say if is_extra_strong_lucas_pseudoprime($_) } 1e10; # _Dana Jacobsen_, May 10 2015
%Y A217719 Cf. A217120 (Lucas pseudoprimes as defined by Baillie and Wagstaff).
%Y A217719 Cf. A217255 (strong Lucas pseudoprimes as defined by Baillie and Wagstaff).
%K A217719 nonn
%O A217719 1,1
%A A217719 _Robert Baillie_, Mar 21 2013