login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
MATHEMATICA
Table[GCD[Binomial[2n, n], 2^n+1], {n, 100}] (* Harvey P. Dale, Aug 26 2012 *)
PROG
(PARI) { for (n=1, 1000, write("b066975.txt", 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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 06:58 EDT 2024. Contains 371906 sequences. (Running on oeis4.)