login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Even pseudoprimes to base 37.
14

%I #15 Sep 29 2024 02:50:48

%S 4,6,12,18,28,36,66,246,268,396,1476,1876,2044,2556,2706,3556,5986,

%T 9514,11034,16236,17466,25626,31956,34716,120786,149076,153756,246484,

%U 259588,281886,283276,483636,552926,559966,623566,670186,721846,846076,1050666

%N Even pseudoprimes to base 37.

%H Amiram Eldar, <a href="/A130441/b130441.txt">Table of n, a(n) for n = 1..548</a> (terms below 10^11; terms 1..243 from Robert G. Wilson v)

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FermatPseudoprime.html">Fermat Pseudoprime</a>.

%H <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>.

%t Do[ f=PowerMod[ 37, 2n-1, 2n ]; If[ f==1, Print[ 2n ] ], {n,2,500000} ]

%t lst = {}; Do[ If[ PowerMod[37, 2n - 1, 2n] == 1, AppendTo[lst, 2n]], {n, 2, 2^31}]; lst (* _Robert G. Wilson v_, Jun 01 2007 *)

%o (PARI) is(k) = k > 2 && !(k % 2) && Mod(37, k)^(k-1) == 1; \\ _Amiram Eldar_, Sep 29 2024

%Y Cf. A020165, A006935, A130433, A090082, A090083, A090084, A090085, A130434, A130435, A130436, A130437, A130438, A130439, A130440, A130442, A130443.

%K nonn

%O 1,1

%A _Alexander Adamchuk_, May 26 2007