login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A217719 Extra strong Lucas pseudoprimes. 4
989, 3239, 5777, 10877, 27971, 29681, 30739, 31631, 39059, 72389, 73919, 75077, 100127, 113573, 125249, 137549, 137801, 153931, 155819, 161027, 162133, 189419, 218321, 231703, 249331, 370229, 429479, 430127, 459191, 473891, 480689, 600059, 621781, 632249, 635627 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000 (from Dana Jacobsen's site)

Robert Baillie, Mathematica code for extra strong Lucas pseudoprimes

Jon Grantham, Frobenius Pseudoprimes, Mathematics of Computation, 7 (2000), 873-891.

Dana Jacobsen, Pseudoprime Statistics, Tables, and Data

PROG

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

CROSSREFS

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

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

Sequence in context: A232429 A232844 A057668 * A223156 A087702 A224565

Adjacent sequences:  A217716 A217717 A217718 * A217720 A217721 A217722

KEYWORD

nonn

AUTHOR

Robert Baillie, Mar 21 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 24 22:57 EST 2020. Contains 338616 sequences. (Running on oeis4.)