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!)
 A103492 Multiplicative suborder of 6 (mod 2n+1) = sord(6, 2n+1). 0
 0, 0, 1, 1, 0, 5, 6, 0, 8, 9, 0, 11, 5, 0, 7, 3, 0, 2, 2, 0, 20, 3, 0, 23, 7, 0, 13, 10, 0, 29, 30, 0, 12, 33, 0, 35, 18, 0, 5, 39, 0, 41, 16, 0, 44, 12, 0, 9, 6, 0, 5, 51, 0, 53, 54, 0, 56, 11, 0, 16, 55, 0, 25, 63, 0, 65, 18, 0, 68, 23, 0, 60, 14, 0, 37, 75, 0, 6, 78, 0, 22, 27, 0, 83, 78, 0, 43 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS a(n) is minimum e for which 6^e = +/-1 mod 2n+1, or zero if no e exists. REFERENCES H. Cohen, Course in Computational Algebraic Number Theory, Springer, 1993, p. 25, Algorithm 1.4.3 LINKS H. J. Smith, XICalc - Extra Precision Integer Calculator. Eric Weisstein's World of Mathematics, Multiplicative Order S. Wolfram, Algebraic Properties of Cellular Automata (1984), Appendix B. CROSSREFS Sequence in context: A088602 A194347 A021869 * A200010 A105580 A047774 Adjacent sequences:  A103489 A103490 A103491 * A103493 A103494 A103495 KEYWORD easy,nonn AUTHOR Harry J. Smith, Feb 11 2005 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 February 25 21:55 EST 2020. Contains 332264 sequences. (Running on oeis4.)