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!)
A195686 a(n) = C(2*n,n) / gcd(n,C(2*n,n)). 2
1, 2, 3, 20, 35, 252, 154, 3432, 6435, 48620, 92378, 705432, 676039, 10400600, 20058300, 10341168, 300540195, 2333606220, 1512522550, 35345263800, 6892326441, 179419291480, 1052049481860, 8233430727600, 2687300306925, 126410606437752, 247959266474052 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
A093526(n) = a(n+1)/(n+2).
a(n) = numerator(C(2n,n)/n). - Enrique Pérez Herrero, Mar 26 2012
Sum_{n>=0} A093527(n)/a(n+1) = Sum_{n>=1} n/binomial(2*n,n) = 2/3 + 2*Pi/(9*sqrt(3)) (A145429). - Amiram Eldar, Jan 26 2022
a(n) = numerator((n + 1)*binomial(2*n+1, n)/(n*(2*n + 1))) for n > 0. - Stefano Spezia, Aug 06 2022
MAPLE
A195686 := n -> binomial(2*n, n)/igcd(n, binomial(2*n, n));
MATHEMATICA
a[n_] := Numerator[Binomial[2n, n]/n]; Join[{1}, Table[a[n], {n, 100}]] (* Enrique Pérez Herrero, Mar 26 2012 *)
CROSSREFS
Sequence in context: A308885 A136886 A191423 * A295365 A233410 A318765
KEYWORD
nonn
AUTHOR
Peter Luschny, Oct 06 2011
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 19 06:44 EDT 2024. Contains 371782 sequences. (Running on oeis4.)