The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062174 a(n) = 3^(n-1) mod n. 3
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 MATHEMATICA Table[PowerMod[3, n-1, n], {n, 90}] (* Harvey P. Dale, Oct 03 2012 *) PROG (PARI) { for (n=1, 1000, write("b062174.txt", n, " ", 3^(n - 1)%n) ) } \\ Harry J. Smith, Aug 02 2009 CROSSREFS Cf. A062172. Sequence in context: A227920 A138291 A201681 * A154754 A102368 A277109 Adjacent sequences:  A062171 A062172 A062173 * A062175 A062176 A062177 KEYWORD nonn AUTHOR Henry Bottomley, Jun 12 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 28 10:29 EDT 2021. Contains 346326 sequences. (Running on oeis4.)