id:A076619 - OEIS Search Results

Search: id:A076619

Displaying 1-1 of 1 results found.

page 1

Least x>1 such that x^d == 1 (mod d) for each divisor d of n ( for all non-square-free numbers n cf. A013929).

+0
1

3, 3, 4, 7, 3, 7, 11, 7, 6, 4, 15, 3, 7, 11, 23, 16, 7, 8, 11, 27, 7, 15, 31, 22, 3, 35, 7, 16, 39, 11, 4, 43, 23, 31, 47, 7, 15, 34, 11, 27, 7, 15, 59, 40, 31, 12, 63, 6, 43, 3, 67, 16, 35, 71, 7, 22, 75, 31, 39, 52, 79, 11, 7, 83, 43, 14, 58, 87, 36, 23, 31, 47, 95, 22, 7, 15, 67 (list; graph; listen)

	OFFSET	`2,1`
	COMMENT	`If n is square-free (cf. A005117) : the least x>1 such that x^d == 1 (mod d) (for each divisor d of n) equals n+1`
	FORMULA	`a(p^m)=p+1 for p prime and m>1`
	CROSSREFS	`Sequence in context: A152949 A058660 A059871 this_sequence A007448 A155689 A051263` `Adjacent sequences: A076616 A076617 A076618 this_sequence A076620 A076621 A076622`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 22 2002`

page 1

Search completed in 0.002 seconds

Last modified December 9 14:43 EST 2009. Contains 170430 sequences.

AT&T Labs Research