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
A125035 Numbers n such that gcd(2^n-69,n)>1. +0
1
10, 26, 30, 50, 67, 70, 88, 90, 110, 130, 136, 150, 170, 182, 183, 185, 190, 198 (list; graph; listen)
OFFSET

1,1

COMMENT

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.

EXAMPLE

gcd(2^10-69,10)=gcd(1024-69,10)=gcd(955,10)=5>1. Note that 67|(2^67-69).

MATHEMATICA

Select[Range[7, 100], PrimeQ[2^#-69]&]

CROSSREFS

Cf. A124977, A125034.

Sequence in context: A078257 A059198 A046961 this_sequence A067264 A043342 A023715

Adjacent sequences: A125032 A125033 A125034 this_sequence A125036 A125037 A125038

KEYWORD

nonn

AUTHOR

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research