login
A214073
Least m>0 such that 2^n-m and n^2-m are relatively prime.
1
1, 3, 1, 15, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 2, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 2, 5, 1, 5, 1, 3, 1, 3, 1, 3, 1, 5, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 2, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 2
OFFSET
1,2
LINKS
EXAMPLE
gcd(63,35) = 7, gcd(62,34) = 2, gcd(61,33) = 1, so a(6) = 3.
MATHEMATICA
b[n_] := 2^n; c[n_] := n^2;
Table[m = 1; While[GCD[b[n] - m, c[n] - m] != 1, m++]; m, {n, 1, 140}]
CROSSREFS
Cf. A071222.
Sequence in context: A286080 A286768 A286114 * A335265 A141459 A318142
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jul 26 2012
STATUS
approved