The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A003568 Least number m such that 12^m == +- 1 (mod 12n + 1). 0
 1, 10, 9, 21, 15, 18, 16, 8, 27, 11, 3, 2, 3, 13, 45, 12, 40, 15, 57, 60, 11, 26, 69, 136, 21, 39, 20, 84, 87, 57, 31, 12, 99, 102, 15, 54, 8, 114, 33, 18, 16, 50, 23, 253, 135, 39, 112, 72, 15, 75, 153, 250, 21, 29, 15, 14, 136, 80, 59, 51, 183, 74, 189, 32 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..64. MATHEMATICA lnm[n_]:=Module[{m=1, x=12n+1, c}, c=PowerMod[12, m, x]; While[!MemberQ[ {1, 12n}, c], m++; c=PowerMod[12, m, x]]; m]; Array[lnm, 60] (* Harvey P. Dale, Sep 02 2014 *) CROSSREFS Sequence in context: A341821 A184959 A309661 * A305196 A099642 A271973 Adjacent sequences: A003565 A003566 A003567 * A003569 A003570 A003571 KEYWORD nonn AUTHOR N. J. A. Sloane STATUS approved

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

Last modified March 1 16:12 EST 2024. Contains 370442 sequences. (Running on oeis4.)