OFFSET
1,1
COMMENTS
This sequence uses the Bruckman definition of "Lucas pseudoprime". There are 400,114 examples less than 2^64. - Dana Jacobsen, Jan 07 2015
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
J. M. Grau, A. M. Oller-Marcen, M. Rodríguez, D. Sadornil, Fermat test with gaussian base and Gaussian pseudoprimes, arXiv preprint arXiv:1401.4708 [math.NT], 2014.
W. Galway, Tables of pseudoprimes and related data [Includes a file with base-2 Fermat pseudoprimes up to 2^64.]
MATHEMATICA
Select[4*Range[8000000]+3, CompositeQ[#] && PowerMod[2, (# - 1), # ] == 1 && Divisible[LucasL[#]-1, #] &] (* Amiram Eldar, Jun 27 2019 *)
PROG
# Using the Feitsma/Galway database from the links:
(Perl) perl -Mntheory=:all -nE 'chomp; say if ($_%4)==3 && (lucas_sequence($_, 1, -1, $_))[1] == 1' psps-below-2-to-64.txt # Dana Jacobsen, Jan 07 2015
(Perl) perl -Mntheory=:all -E 'foroddcomposites { say if $_%4 == 3 && ispseudoprime($_, 2) && (lucas_sequence($_, 1, -1, $_))[1] == 1 } 1e14' # Dana Jacobsen, Jan 10 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
José María Grau Ribas, Oct 12 2013
EXTENSIONS
More terms from Dana Jacobsen, Jan 07 2015
a(16)-a(24) from Amiram Eldar, Jun 27 2019
STATUS
approved