id:A091733 - OEIS Search Results

Search: id:A091733

Displaying 1-1 of 1 results found.

page 1

a(n) is the least m > 1 such that m^3 = 1 (mod n).

+0
1

2, 3, 4, 5, 6, 7, 2, 9, 4, 11, 12, 13, 3, 9, 16, 17, 18, 7, 7, 21, 4, 23, 24, 25, 26, 3, 10, 9, 30, 31, 5, 33, 34, 35, 11, 13, 10, 7, 16, 41, 42, 25, 6, 45, 16, 47, 48, 49, 18, 51, 52, 9, 54, 19, 56, 9, 7, 59, 60, 61, 13, 5, 4, 65, 16, 67, 29, 69, 70, 11, 72, 25, 8, 47, 76, 45, 23, 55, 23 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(7) = 2 because 2^3 is congruent to 1 (mod 7).`
	PROGRAM	`(Matlab) m = 2; while mod(m^3 - 1, n); m = m + 1; end; m`
	CROSSREFS	`Cf. A070667, A083501.` `Sequence in context: A038387 A043267 A167514 this_sequence A066990 A097449 A104415` `Adjacent sequences: A091730 A091731 A091732 this_sequence A091734 A091735 A091736`
	KEYWORD	`easy,nonn`
	AUTHOR	`David Wasserman (wasserma(AT)spawar.navy.mil), Mar 05 2004`

page 1

Search completed in 0.003 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research