|
| |
|
|
A056025
|
|
Numbers n such that n^12 == 1 (mod 13^2).
|
|
1
| |
|
|
1, 19, 22, 23, 70, 80, 89, 99, 146, 147, 150, 168, 170, 188, 191, 192, 239, 249, 258, 268, 315, 316, 319, 337, 339, 357, 360, 361, 408, 418, 427, 437, 484, 485, 488, 506, 508, 526, 529, 530, 577, 587, 596, 606, 653, 654, 657, 675, 677, 695, 698, 699, 746
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| From 19 to 168 inclusive, these are the numbers that 'fool' the strong pseudoprimality test described in Wilf (1986) in regards to determining whether 169 is composite or not. - Alonso del Arte, Feb 05 2012
|
|
|
REFERENCES
| Herbert S. Wilf, Algorithms and Complexity. Englewood Cliffs, New Jersey: Prentice-Hall (1986): 158 - 160
|
|
|
MATHEMATICA
| Select[ Range[ 800 ], PowerMod[ #, 12, 169 ]==1& ]
|
|
|
CROSSREFS
| Sequence in context: A050714 A113868 A023152 * A099954 A050955 A072305
Adjacent sequences: A056022 A056023 A056024 * A056026 A056027 A056028
|
|
|
KEYWORD
| nonn,changed
|
|
|
AUTHOR
| Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 08 2000
|
|
|
EXTENSIONS
| Definition corrected by T. D. Noe (noe(AT)sspectra.com), Aug 23 2008
|
| |
|
|
