%I A003570
%S A003570 0,1,2,1,1,5,2,4,4,3,2,11,10,3,14,5,5,4,6,4,10,7,4,23,7,8,26,20,3,29,10,
%T A003570 2,2,11,22,35,3,20,10,13,9,41,8,28,11,4,10,12,8,5,50,17,4,53,6,12,14,44,
%U A003570 4,8,55,20,50,7,7,65,6,12,34,23,46,20,14,14,74,5,8,20,26,52,11,27,20,83
%N A003570 a(n) = least positive number m such that 8^m == +1 or -1 mod 2n + 1, 
               with a(0) = 0 by convention.
%C A003570 Multiplicative suborder of 8 (mod 2n+1) = sord(8, 2n+1). - Harry J. Smith 
               (hjsmithh(AT)sbcglobal.net), Feb 11 2005
%D A003570 H. Cohen, Course in Computational Algebraic Number Theory, Springer, 
               1993, p. 25, Algorithm 1.4.3
%H A003570 H. J. Smith, <a href="http://harry-j-smith.com/hjsmithh/download.html#XICalc">
               XICalc - Extra Precision Integer Calculator.</a>
%H A003570 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               MultiplicativeOrder.html">Link to a section of The World of Mathematics</
               a>, Multiplicative Order.
%H A003570 S. Wolfram, <a href="http://www.stephenwolfram.com/publications/articles/
               ca/84-properties/9/text.html">Algebraic Properties of Cellular Automata 
               (1984)</a>, Appendix B.
%e A003570 a(1) = 1 since 8^1 = 8 == -1 mod 3.
%e A003570 a(2) = 2 since 8^2 = 64 == -1 mod 5.
%Y A003570 Sequence in context: A047888 A128704 A075259 this_sequence A011281 A100398 
               A160364
%Y A003570 Adjacent sequences: A003567 A003568 A003569 this_sequence A003571 A003572 
               A003573
%K A003570 nonn
%O A003570 0,3
%A A003570 N. J. A. Sloane (njas(AT)research.att.com).
%E A003570 More terms from Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 11 2005
%E A003570 Edited by N. J. A. Sloane (njas(AT)research.att.com), May 22 2008 at 
               the suggestion of Jeremy Gardiner