Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125035
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A125035
%S A125035 10,26,30,50,67,70,88,90,110,130,136,150,170,182,183,185,190,198
%N A125035 Numbers n such that gcd(2^n-69,n)>1.
%C A125035 Corresponding gcd's are 5,13,5,5,67,5,11,5,5,5,17,5,5,13,61,37,5,11. 
               Cf. A125034, A124977.
%e A125035 gcd(2^10-69,10)=gcd(1024-69,10)=gcd(955,10)=5>1. Note that 67|(2^67-69).
%t A125035 Select[Range[7,100],PrimeQ[2^#-69]&]
%Y A125035 Cf. A124977, A125034.
%Y A125035 Sequence in context: A078257 A059198 A046961 this_sequence A067264 A043342 
               A023715
%Y A125035 Adjacent sequences: A125032 A125033 A125034 this_sequence A125036 A125037 
               A125038
%K A125035 nonn
%O A125035 1,1
%A A125035 Zak Seidov (zakseidov(AT)yahoo.com), Nov 17 2006

    
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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research