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

A066975
a(n) = gcd(binomial(2n,n), 2^n + 1).
1
1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 17, 1, 5, 9, 1, 3, 5, 3, 1, 3, 5, 3, 1, 3, 1, 1, 17, 3, 41, 1, 1, 3, 5, 129, 1, 1, 5, 1, 1, 3, 5, 3, 17, 9, 5, 3, 1, 3, 1, 9, 1, 3, 5, 3, 1, 3, 5, 3, 17, 3, 1, 3, 1, 33, 5, 3, 1, 9, 115825, 3, 97, 3, 5, 99, 1, 129, 5, 3, 1, 1, 5, 3, 17, 11, 5, 3, 1, 3, 35425, 1, 1
OFFSET
1,5
LINKS
MATHEMATICA
Table[GCD[Binomial[2n, n], 2^n+1], {n, 100}] (* Harvey P. Dale, Aug 26 2012 *)
PROG
(PARI) a(n) = { gcd(binomial(2*n, n), 2^n + 1) } \\ Harry J. Smith, Apr 12 2010
CROSSREFS
Sequence in context: A100375 A353063 A274613 * A355879 A291634 A098877
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 26 2002
STATUS
approved