login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000790 Primary pretenders: least composite c such that n^c == n (mod c). 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; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

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 * A068556 A078243 A024246

Adjacent sequences:  A000787 A000788 A000789 * A000791 A000792 A000793

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:58 EST 2012. Contains 205985 sequences.