Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000790
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A000790
%S A000790 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,
%T A000790 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,
%U A000790 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
%N A000790 Primary pretenders: least composite c such that n^c == n (mod c).
%C A000790 It is remarkable that this sequence is periodic with period
%C A000790 19568584333460072587245340037736278982017213829337604336734362\
%C A000790 294738647777395483196097971852999259921329236506842360439300.
%D A000790 J. H. Conway, R. K. Guy, W. A. Schneeberger and N. J. A. Sloane, The 
               Primary Pretenders, Acta Arith. 78 (1997), 307-313.
%H A000790 T. D. Noe, <a href="b000790.txt">Table of n, a(n) for n=0..10000</a>
%H A000790 <a href="http://www.research.att.com/~njas/doc/primary.html">Primary 
               Pretenders article</a>
%Y A000790 Cf. A108574 (all values occurring in this sequence)
%Y A000790 Sequence in context: A080509 A063439 A107052 this_sequence A068556 A078243 
               A024246
%Y A000790 Adjacent sequences: A000787 A000788 A000789 this_sequence A000791 A000792 
               A000793
%K A000790 nonn,nice
%O A000790 0,1
%A A000790 N. J. A. Sloane (njas(AT)research.att.com).

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research