cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A071416 a(n) = gcd(n, binomial(2*n, n)).

Original entry on oeis.org

1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 15, 2, 1, 6, 1, 20, 3, 2, 1, 12, 1, 2, 1, 28, 1, 2, 1, 2, 3, 2, 7, 4, 1, 2, 1, 20, 1, 42, 1, 4, 45, 2, 1, 12, 1, 2, 3, 4, 1, 6, 1, 8, 3, 2, 1, 12, 1, 2, 3, 2, 5, 66, 1, 4, 3, 10, 1, 36, 1, 2, 15, 4, 77, 6, 1, 20, 1, 2, 1, 28, 5, 2, 3, 88, 1, 10, 91, 4, 1, 2, 5
Offset: 1

Views

Author

Reinhard Zumkeller, May 29 2002

Keywords

Comments

a(n) = n for n in A014847. - Reinhard Zumkeller
a(n) = gcd(n, C(n)), C(n) the Catalan numbers. - Peter Luschny Oct 06 2011

Examples

			a(10) = gcd(10, binomial(20, 10)) = gcd(10, 184756) = 2.
		

Crossrefs

Programs

  • Mathematica
    Table[GCD[n,Binomial[2n,n]],{n,100}] (* Harvey P. Dale, Nov 10 2011 *)