id:A066858 - OEIS Search Results

Search: id:A066858

Displaying 1-1 of 1 results found.

page 1

Smallest k>1 such that for each integer x, x^k=x or x^k=0 (mod n); or 0 if no such k exists.

+0
1

2, 3, 3, 5, 3, 7, 3, 7, 5, 11, 0, 13, 7, 5, 5, 17, 0, 19, 0, 7, 11, 23, 0, 21, 13, 19, 0, 29, 5, 31, 9, 11, 17, 13, 0, 37, 19, 13, 0, 41, 7, 43, 0, 0, 23, 47, 0, 43, 0, 17, 0, 53, 0, 21, 0, 19, 29, 59, 0, 61, 31, 0, 17, 13, 11, 67, 0, 23, 13, 71, 0, 73, 37, 0, 0, 31, 13, 79, 0, 55, 41 (list; graph; listen)

	OFFSET	`2,1`
	COMMENT	`By Fermat's little theorem if k exists then k <= n (with equality only if n prime). All terms that are 0 are not squarefree and not prime powers. - Larry Reeves`
	CROSSREFS	`Sequence in context: A111607 A117531 A105555 this_sequence A152864 A152984 A064921` `Adjacent sequences: A066855 A066856 A066857 this_sequence A066859 A066860 A066861`
	KEYWORD	`nonn`
	AUTHOR	`Roger Cuculiere (cuculier(AT)imaginet.fr), Jan 22 2002`
	EXTENSIONS	`More terms from Larry Reeves (larryr(AT)acm.org), Jun 11 2002`

page 1

Search completed in 0.002 seconds

Last modified November 23 10:40 EST 2009. Contains 167421 sequences.

AT&T Labs Research