|
| |
|
|
A125035
|
|
Numbers n such that gcd(2^n-69,n)>1.
|
|
0
| |
|
|
10, 26, 30, 50, 67, 70, 88, 90, 110, 130, 136, 150, 170, 182, 183, 185, 190, 198
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| 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 * A067264 A043342 A023715
Adjacent sequences: A125032 A125033 A125034 * A125036 A125037 A125038
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Zak Seidov (zakseidov(AT)yahoo.com), Nov 17 2006
|
| |
|
|
