id:A103496 - OEIS Search Results

Search: id:A103496

Displaying 1-1 of 1 results found.

page 1

Multiplicative suborder of 10 (mod 2n+1) = sord(10, 2n+1).

+0
1

0, 1, 0, 3, 1, 1, 3, 0, 8, 9, 6, 11, 0, 3, 14, 15, 2, 0, 3, 6, 5, 21, 0, 23, 21, 16, 13, 0, 18, 29, 30, 6, 0, 33, 22, 35, 4, 0, 3, 13, 9, 41, 0, 28, 22, 3, 15, 0, 48, 2, 2, 17, 0, 53, 54, 3, 56, 0, 6, 48, 11, 5, 0, 21, 21, 65, 9, 0, 4, 23, 46, 3, 0, 42, 74, 75, 16, 0, 39, 13, 33, 81, 0, 83, 39 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`a(n) is minimum e for which 10^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, Link to a section of The World of Mathematics, Multiplicative Order.` `S. Wolfram, Algebraic Properties of Cellular Automata (1984), Appendix B.`
	CROSSREFS	`Sequence in context: A086639 A016564 A104443 this_sequence A124921 A076498 A110268` `Adjacent sequences: A103493 A103494 A103495 this_sequence A103497 A103498 A103499`
	KEYWORD	`easy,nonn`
	AUTHOR	`Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 11 2005`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research