id:A003569 - OEIS Search Results

Search: id:A003569

Displaying 1-1 of 1 results found.

page 1

a(n) = least positive number m such that 4^m == +1 or -1 mod 2n + 1, with a(0) = 0 by convention.

+0
1

0, 1, 1, 3, 3, 5, 3, 2, 2, 9, 3, 11, 5, 9, 7, 5, 5, 6, 9, 6, 5, 7, 6, 23, 21, 4, 13, 10, 9, 29, 15, 3, 3, 33, 11, 35, 9, 10, 15, 39, 27, 41, 4, 14, 11, 6, 5, 18, 12, 15, 25, 51, 6, 53, 9, 18, 7, 22, 6, 12, 55, 10, 25, 7, 7, 65, 9, 18, 17, 69, 23, 30, 7, 21, 37, 15, 12, 10, 13, 26, 33, 81, 10 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`Multiplicative suborder of 4 (mod 2n+1) = sord(4, 2n+1). - Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 11 2005`
	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: A115155 A136549 A077924 this_sequence A066670 A013606 A054906` `Adjacent sequences: A003566 A003567 A003568 this_sequence A003570 A003571 A003572`
	KEYWORD	`easy,nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 11 2005` `Edited by N. J. A. Sloane (njas(AT)research.att.com), May 22 2008`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research