|
%I #23 Mar 15 2022 02:36:55
%S 1,19,22,23,70,80,89,99,146,147,150,168,170,188,191,192,239,249,258,
%T 268,315,316,319,337,339,357,360,361,408,418,427,437,484,485,488,506,
%U 508,526,529,530,577,587,596,606,653,654,657,675,677,695,698,699,746
%N Numbers k such that k^12 == 1 (mod 13^2).
%C 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
%D Herbert S. Wilf, Algorithms and Complexity, Englewood Cliffs, New Jersey: Prentice-Hall, 1986, pp. 158-160.
%H Amiram Eldar, <a href="/A056025/b056025.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,0,0,1,-1).
%t Select[ Range[ 800 ], PowerMod[ #, 12, 169 ]==1& ]
%o (PARI) is(k)=Mod(k,169)^12==1 \\ _Charles R Greathouse IV_, Feb 07 2018
%Y Cf. A056021, A056022, A056024, A056026, A056027, A056028, A056031, A056034, A056035.
%K nonn,easy
%O 1,2
%A _Robert G. Wilson v_, Jun 08 2000
%E Definition corrected by _T. D. Noe_, Aug 23 2008
|
