id:A103495 - OEIS Search Results

Search: id:A103495

Displaying 1-1 of 1 results found.

page 1

Multiplicative suborder of 9 (mod n) = sord(9, n).

+0
1

0, 0, 1, 0, 1, 1, 0, 3, 1, 0, 1, 5, 0, 3, 3, 0, 2, 4, 0, 9, 2, 0, 5, 11, 0, 5, 3, 0, 3, 7, 0, 15, 4, 0, 4, 6, 0, 9, 9, 0, 2, 2, 0, 21, 5, 0, 11, 23, 0, 21, 5, 0, 3, 13, 0, 10, 3, 0, 7, 29, 0, 5, 15, 0, 8, 6, 0, 11, 8, 0, 6, 35, 0, 3, 9, 0, 9, 15, 0, 39, 2, 0, 2, 41, 0, 8, 21, 0, 5, 22, 0, 3, 11, 0, 23 (list; graph; listen)

	OFFSET	`0,8`
	COMMENT	`a(n) is minimum e for which 9^e = +/-1 mod n, 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	`Adjacent sequences: A103492 A103493 A103494 this_sequence A103496 A103497 A103498` `Sequence in context: A099905 A085391 A050143 this_sequence A081719 A121314 A119271`
	KEYWORD	`easy,nonn`
	AUTHOR	`Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 08 2005`

page 1

Search completed in 0.002 seconds

Last modified October 16 00:31 EDT 2008. Contains 145098 sequences.

AT&T Labs Research