login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A217719 Extra strong Lucas pseudoprimes. 3
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

Table of n, a(n) for n=1..35.

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 A181965 A087702

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 10 13:27 EST 2016. Contains 279004 sequences.