A214709 Least m>0 such that n!-m and 2^n-m are relatively prime.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset

1,11

Links

Clark Kimberling, Table of n, a(n) for n = 1..1000

Example

gcd(11!-1,2^11-1) = 23, gcd(11!-2, 2^11-2) = 2, gcd(11!-3,2^11-3) = 1, so a(11) = 3.

Mathematica

Table[m = 1; While[GCD[n! - m, 2^n - m] != 1, m++]; m, {n, 1, 140}]

Crossrefs

Cf. A214074, A214707.

Sequence in context: A328516 A328517 A007362 * A369317 A060268 A339877

Adjacent sequences: A214706 A214707 A214708 * A214710 A214711 A214712

Keyword

nonn,easy

Author

Clark Kimberling, Jul 27 2012

Status

approved