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

%I #9 Mar 22 2020 10:14:25

%S 1,1,1,1,1,6,1,1,1,2,1,2,1,2,15,1,1,6,1,10,3,2,1,6,1,2,1,28,1,2,1,1,3,

%T 2,7,2,1,2,1,10,1,42,1,4,45,2,1,6,1,2,3,4,1,6,1,4,3,2,1,12,1,2,3,1,5,

%U 66,1,2,3,10,1,18,1,2,15,4,77,6,1,10,1,2

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

%H Hugo Pfoertner, <a href="/A333461/b333461.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A058005(n)/2.

%o (PARI) for(n=1,82,print1(gcd(2*n,binomial(2*n,n))/2,", "))

%Y Cf. A058005, A071416.

%K nonn

%O 1,6

%A _Hugo Pfoertner_, Mar 22 2020

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 August 17 04:30 EDT 2024. Contains 375198 sequences. (Running on oeis4.)