A217719 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A217719

Extra strong Lucas pseudoprimes.

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).