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”).

A214180
Least m>0 such that 2^n-m and 5^n-m are relatively prime.
3
1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 3, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 3, 2, 1, 2, 3, 3, 1, 2, 1, 2, 3, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 3, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 3, 2, 1, 2, 3
OFFSET
1,2
COMMENTS
a(616) = 5.
LINKS
EXAMPLE
gcd(16-1,625-1) = 3, gcd(16-2,625-2) = 7, gcd(16-3,625-3) = 1, so a(4) = 3.
MATHEMATICA
Table[m = 1; While[GCD[2^n - m, 5^n - m] != 1, m++]; m, {n, 1, 140}]
CROSSREFS
Sequence in context: A349326 A185894 A376305 * A343073 A184166 A029423
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jul 27 2012
STATUS
approved