login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A217719 Extra strong Lucas pseudoprimes. 4

%I #27 Nov 22 2019 03:38:26

%S 989,3239,5777,10877,27971,29681,30739,31631,39059,72389,73919,75077,

%T 100127,113573,125249,137549,137801,153931,155819,161027,162133,

%U 189419,218321,231703,249331,370229,429479,430127,459191,473891,480689,600059,621781,632249,635627

%N Extra strong Lucas pseudoprimes.

%H Amiram Eldar, <a href="/A217719/b217719.txt">Table of n, a(n) for n = 1..10000</a> (from Dana Jacobsen's site)

%H Robert Baillie, <a href="/A217719/a217719.txt">Mathematica code for extra strong Lucas pseudoprimes</a>

%H 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 Dana Jacobsen, <a href="http://ntheory.org/pseudoprimes.html">Pseudoprime Statistics, Tables, and Data</a>

%o (Perl) use ntheory ":all"; foroddcomposites { say if is_extra_strong_lucas_pseudoprime($_) } 1e10; # _Dana Jacobsen_, May 10 2015

%Y Cf. A217120 (Lucas pseudoprimes as defined by Baillie and Wagstaff).

%Y Cf. A217255 (strong Lucas pseudoprimes as defined by Baillie and Wagstaff).

%K nonn

%O 1,1

%A _Robert Baillie_, Mar 21 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)