login
A087968
a(n) = gcd(1 + 2^n, n^2).
3
1, 1, 9, 1, 1, 1, 1, 1, 27, 25, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 81, 1, 1, 25, 1, 1, 9, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 27, 1, 1, 1, 1, 125, 9, 1, 1, 1, 121, 1, 9, 1, 1, 1, 1, 1, 27, 1, 1, 1, 1, 289, 9, 25, 1, 1, 1, 1, 9, 1, 1, 169, 1, 1, 243, 1, 1, 1, 1, 1, 9, 1, 1, 25, 1, 1, 9, 1, 1, 1
OFFSET
1,3
LINKS
EXAMPLE
a(9) = gcd(2^9 + 1,9^2) = gcd(513,81) = 27.
MAPLE
seq(gcd(2^n+1, n^2), n=1..100); # Muniru A Asiru, Sep 22 2018
PROG
(PARI) A087968(n) = gcd((2^n)+1, n^2); \\ Antti Karttunen, Sep 22 2018
(GAP) List([1..100], n->Gcd(2^n+1, n^2)); # Muniru A Asiru, Sep 22 2018
CROSSREFS
Sequence in context: A284099 A176410 A087966 * A340365 A110483 A348734
KEYWORD
nonn
AUTHOR
Labos Elemer, Sep 22 2003
STATUS
approved