OFFSET
1,2
COMMENTS
From 19 to 168 inclusive, these are the numbers that 'fool' the strong pseudoprimality test described in Wilf (1986) in regard to determining whether 169 is composite. - Alonso del Arte, Feb 05 2012
REFERENCES
Herbert S. Wilf, Algorithms and Complexity, Englewood Cliffs, New Jersey: Prentice-Hall, 1986, pp. 158-160.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,0,0,1,-1).
MATHEMATICA
Select[ Range[ 800 ], PowerMod[ #, 12, 169 ]==1& ]
PROG
(PARI) is(k)=Mod(k, 169)^12==1 \\ Charles R Greathouse IV, Feb 07 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Robert G. Wilson v, Jun 08 2000
EXTENSIONS
Definition corrected by T. D. Noe, Aug 23 2008
STATUS
approved