id:A066727 - OEIS Search Results

Search: id:A066727

Displaying 1-1 of 1 results found.

page 1

Least factor of n^Phi(n) -1.

+0
2

0, 1, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 17, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 13, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`n^Phi(n)-1 is never prime. This sequence is an outgrowth of Euler's generalization to Fermat's little theorem.`
	MATHEMATICA	`a = {}; Do[ a = Append[a, FactorInteger[ n^EulerPhi[n] - 1, FactorComplete -> False][[1, 1]]], {n, 1, 100}]; a`
	CROSSREFS	`Cf. A066699.` `Sequence in context: A098668 A112763 A093476 this_sequence A076606 A056927 A094290` `Adjacent sequences: A066724 A066725 A066726 this_sequence A066728 A066729 A066730`
	KEYWORD	`nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 15 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research