id:A111305 - OEIS Search Results

Search: id:A111305

Displaying 1-1 of 1 results found.

page 1

Composite numbers n such that a^(n-1) = 1 mod n only when a = 1 mod n.

+0
1

4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 54, 56, 58, 60, 62, 64, 68, 72, 74, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 114, 116, 118, 120, 122, 126, 128, 132, 134, 136, 138, 140, 142, 144 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`These unCarmichael numbers fail the Fermat primality test as often as possible.` `All such numbers are even: for odd n, (-1)^(n-1) = 1.` `The even numbers not in this sequence are 2 and A039772.`
	EXAMPLE	`10 is there because 3^9 = 3, 7^9 = 7, 9^9 = 9 mod 10.`
	CROSSREFS	`Cf. A002997, A039772.` `Sequence in context: A103517 A163300 A093161 this_sequence A134928 A141109 A061344` `Adjacent sequences: A111302 A111303 A111304 this_sequence A111306 A111307 A111308`
	KEYWORD	`nonn`
	AUTHOR	`Karsten Meyer (arbol01(AT)gmx.de), Nov 02 2005`
	EXTENSIONS	`Edited by Don Reble (djr(AT)nk.ca), May 16 2006`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research