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!)
A071416 a(n) = gcd(n, binomial(2*n, n)). 4

%I #19 Oct 20 2019 01:56:01

%S 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,

%T 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,

%U 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

%N a(n) = gcd(n, binomial(2*n, n)).

%C a(n) = n for n in A014847. - _Reinhard Zumkeller_

%C a(n) = gcd(n, C(n)), C(n) the Catalan numbers. - _Peter Luschny_ Oct 06 2011

%H T. D. Noe, <a href="/A071416/b071416.txt">Table of n, a(n) for n = 1..1000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CentralBinomialCoefficient.html">Central Binomial Coefficient</a>

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

%t Table[GCD[n,Binomial[2n,n]],{n,100}] (* _Harvey P. Dale_, Nov 10 2011 *)

%Y Cf. A000984, A000108.

%K nonn,nice

%O 1,2

%A _Reinhard Zumkeller_, May 29 2002

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 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)