login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

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

Adjacent sequences:  A214070 A214071 A214072 * A214074 A214075 A214076

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 26 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 24 18:08 EDT 2021. Contains 348233 sequences. (Running on oeis4.)