id:A000790 - OEIS Search Results

Search: id:A000790

Displaying 1-1 of 1 results found.

page 1

Primary pretenders: least composite c such that n^c == n (mod c).

+0
2

4, 4, 341, 6, 4, 4, 6, 6, 4, 4, 6, 10, 4, 4, 14, 6, 4, 4, 6, 6, 4, 4, 6, 22, 4, 4, 9, 6, 4, 4, 6, 6, 4, 4, 6, 9, 4, 4, 38, 6, 4, 4, 6, 6, 4, 4, 6, 46, 4, 4, 10, 6, 4, 4, 6, 6, 4, 4, 6, 15, 4, 4, 9, 6, 4, 4, 6, 6, 4, 4, 6, 9, 4, 4, 15, 6, 4, 4, 6, 6, 4, 4, 6, 21, 4, 4, 10, 6, 4 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`It is remarkable that this sequence is periodic with period` `19568584333460072587245340037736278982017213829337604336734362\` `294738647777395483196097971852999259921329236506842360439300.`
	REFERENCES	`J. H. Conway, R. K. Guy, W. A. Schneeberger and N. J. A. Sloane, The Primary Pretenders, Acta Arith. 78 (1997), 307-313.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000` `Primary Pretenders article`
	CROSSREFS	`Cf. A108574 (all values occurring in this sequence)` `Sequence in context: A080509 A063439 A107052 this_sequence A068556 A078243 A024246` `Adjacent sequences: A000787 A000788 A000789 this_sequence A000791 A000792 A000793`
	KEYWORD	`nonn,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research