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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A259613 a(n) = binomial(6*n,2*n)/3, n>0, a(0)=1. 1
 1, 5, 165, 6188, 245157, 10015005, 417225900, 17620076360, 751616304549, 32308782859535, 1397281501935165, 60727722660586800, 2650087220696342700, 116043807643289338428, 5096278545356362962504, 224377658168860057076688 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..600 V. V. Kruchinin and D. V. Kruchinin, A Generating Function for the Diagonal T_{2n,n} in Triangles, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.6 FORMULA G.f.: A(x) = 1 + (x*B(x)')/(B(x)) where B(x) = 2 * (1 + x*B(x)^2)^2 / (1 - 2*x*B(x)^2 + sqrt(1-8*x*B(x)^2)). a(n) ~ 3^(6*n-1/2) / (sqrt(Pi*n) * 2^(4*n+3/2)). - Vaclav Kotesovec, Jul 01 2015 a(n) = A025174(2*n), n>0. - R. J. Mathar, Jun 07 2016 MATHEMATICA Join[{1}, Table[Binomial[6 n, 2 n]/3, {n, 30}]] (* Vincenzo Librandi, Jul 01 2015 *) PROG (PARI) vector(20, n, n--; if (n==0, 1, binomial(6*n, 2*n)/3)) \\ Michel Marcus, Jul 01 2015 (Magma) [1] cat [Binomial(6*n, 2*n)/3: n in [1..20]]; // Vincenzo Librandi, Jul 01 2015 CROSSREFS Cf. A182959. Sequence in context: A317456 A203185 A129995 * A047940 A229414 A210923 Adjacent sequences: A259610 A259611 A259612 * A259614 A259615 A259616 KEYWORD nonn AUTHOR Vladimir Kruchinin, Jun 30 2015 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.

Last modified March 25 09:47 EDT 2023. Contains 361520 sequences. (Running on oeis4.)