This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070676 Smallest m in range 1..phi(n) such that 3^m == 1 mod n, or 0 if no such number exists. 9
 0, 1, 0, 2, 4, 0, 6, 2, 0, 4, 5, 0, 3, 6, 0, 4, 16, 0, 18, 4, 0, 5, 11, 0, 20, 3, 0, 6, 28, 0, 30, 8, 0, 16, 12, 0, 18, 18, 0, 4, 8, 0, 42, 10, 0, 11, 23, 0, 42, 20, 0, 6, 52, 0, 20, 6, 0, 28, 29, 0, 10, 30, 0, 16, 12, 0, 22, 16, 0, 12, 35, 0, 12, 18, 0, 18, 30, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS MATHEMATICA Table[SelectFirst[Range[EulerPhi[n]], PowerMod[3, # , n]==1&, 0], {n, 80}] (* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, Aug 18 2015 *) PROG (MAGMA) [0] cat [Modorder(3, n): n in [2..100]]; // Vincenzo Librandi, Apr 01 2014 CROSSREFS Cf. A070667-A070675, A002326, A053447, A070677, A070681, A070678, A053451, A070679, A070682, A070680, A070683. Sequence in context: A323099 A002652 A202541 * A291306 A068451 A131715 Adjacent sequences:  A070673 A070674 A070675 * A070677 A070678 A070679 KEYWORD nonn AUTHOR N. J. A. Sloane and Amarnath Murthy, May 08 2002 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 October 19 21:08 EDT 2019. Contains 328228 sequences. (Running on oeis4.)