Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058910
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A058910
%S A058910 3,5,17,257,641,1217,14593,167809,671233,1314497,180449537,424050817
%N A058910 Smallest prime number, not already in sequence, such that the product 
               M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod 
               M).
%e A058910 a(3)=17 because n=3*5*17=255 and 2^256 = 1 (mod 255)
%Y A058910 Sequence in context: A107312 A083213 A056826 this_sequence A023394 A056130 
               A078726
%Y A058910 Adjacent sequences: A058907 A058908 A058909 this_sequence A058911 A058912 
               A058913
%K A058910 nonn
%O A058910 0,1
%A A058910 Joe K. Crump (joecr(AT)carolina.rr.com), Jan 09 2001

    
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 December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research