login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A265166
Numbers n such that 2^n-1 and 5^n-1 are coprime.
0
1, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 27, 29, 31, 33, 37, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 77, 79, 81, 83, 85, 87, 89, 91, 93, 97, 101, 103, 107, 109, 111, 113, 115, 121, 123, 125, 127, 129, 131, 133, 137, 139, 141, 143
OFFSET
1,2
COMMENTS
Also numbers n such that A270390(n) = 1.
Conjectured to be infinite: see the Ailon and Rudnick paper.
LINKS
EXAMPLE
gcd(2^1-1, 5^1-1) = gcd(1,4) = 1, so a(1) = 1.
gcd(2^3-1, 5^3-1) = gcd(7,124) = 1, so a(2) = 3.
gcd(2^4-1, 5^4-1) = gcd(15,624) = 3, so 4 is not in the sequence.
MATHEMATICA
Select[Range[200], GCD[2^# - 1, 5^# - 1] == 1 &]
Select[Range[150], CoprimeQ[2^#-1, 5^#-1]&] (* Harvey P. Dale, Apr 12 2018 *)
PROG
(Magma) [n: n in [1..200] | Gcd(2^n-1, 5^n-1) eq 1];
CROSSREFS
KEYWORD
nonn
AUTHOR
Vincenzo Librandi, May 01 2016
STATUS
approved