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”).
%I #14 Jun 01 2018 06:54:27
%S 0,1,0,3,1,3,1,3,0,3,1,3,1,3,9,11,1,9,1,7,9,3,1,3,6,3,0,27,1,3,1,11,9,
%T 3,4,27,1,3,9,27,1,33,1,27,36,3,1,27,43,33,9,27,1,27,4,3,9,3,1,27,1,3,
%U 9,43,16,45,1,27,9,13,1,27,1,3,69,27,25,9,1,27,0,3,1,75,81,3,9,75,1,63
%N a(n) = 3^(n-1) mod n.
%H Harry J. Smith, <a href="/A062174/b062174.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>
%t Table[PowerMod[3,n-1,n],{n,90}] (* _Harvey P. Dale_, Oct 03 2012 *)
%o (PARI) { for (n=1, 1000, write("b062174.txt", n, " ", 3^(n - 1)%n) ) } \\ _Harry J. Smith_, Aug 02 2009
%Y Cf. A062172.
%K nonn
%O 1,4
%A _Henry Bottomley_, Jun 12 2001