id:A103498 - OEIS Search Results

Search: id:A103498

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 2, 3, 0, 1, 1, 0, 8, 3, 0, 11, 10, 0, 2, 15, 0, 12, 9, 0, 20, 21, 0, 23, 21, 0, 26, 4, 0, 29, 15, 0, 4, 33, 0, 35, 18, 0, 6, 13, 0, 41, 16, 0, 4, 3, 0, 12, 8, 0, 50, 51, 0, 53, 27, 0, 56, 44, 0, 48, 11, 0, 50, 63, 0, 65, 3, 0, 68, 69, 0, 2, 2, 0, 74, 75, 0, 60, 3, 0, 66, 81, 0, 83, 13, 0 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`a(n) is minimum e for which 12^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: A155839 A135814 A038570 this_sequence A030386 A096799 A106728` `Adjacent sequences: A103495 A103496 A103497 this_sequence A103499 A103500 A103501`
	KEYWORD	`easy,nonn`
	AUTHOR	`Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 11 2005`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research