cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A130441 Even pseudoprimes to base 37.

This page as a plain text file.
%I A130441 #16 Feb 16 2025 08:33:06
%S A130441 4,6,12,18,28,36,66,246,268,396,1476,1876,2044,2556,2706,3556,5986,
%T A130441 9514,11034,16236,17466,25626,31956,34716,120786,149076,153756,246484,
%U A130441 259588,281886,283276,483636,552926,559966,623566,670186,721846,846076,1050666
%N A130441 Even pseudoprimes to base 37.
%H A130441 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 A130441 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FermatPseudoprime.html">Fermat Pseudoprime</a>.
%H A130441 <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>.
%t A130441 Do[ f=PowerMod[ 37, 2n-1, 2n ]; If[ f==1, Print[ 2n ] ], {n,2,500000} ]
%t A130441 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 A130441 (PARI) is(k) = k > 2 && !(k % 2) &&  Mod(37, k)^(k-1) == 1; \\ _Amiram Eldar_, Sep 29 2024
%Y A130441 Cf. A020165, A006935, A130433, A090082, A090083, A090084, A090085, A130434, A130435, A130436, A130437, A130438, A130439, A130440, A130442, A130443.
%K A130441 nonn
%O A130441 1,1
%A A130441 _Alexander Adamchuk_, May 26 2007