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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036829 a(n) = Sum_{k=0..n-1} C(3*k,k)*C(3*n-3*k-2,n-k-1). 3
 0, 1, 7, 48, 327, 2221, 15060, 102012, 690519, 4671819, 31596447, 213633696, 1444131108, 9760401756, 65957919496, 445671648228, 3011064814455, 20341769686311, 137412453018933, 928188965638464, 6269358748632207, 42343731580741821 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 REFERENCES M. Petkovsek et al., A=B, Peters, 1996, p. 97. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..1000 FORMULA G.f.: (g-g^2)/(3*g-1)^2 where g*(1-g)^2 = x. - Mark van Hoeij, Nov 09 2011 Recurrence: 8*(n-1)*(2*n-1)*a(n) = 6*(36*n^2-81*n+49)*a(n-1) - 81*(3*n-5)*(3*n-4)*a(n-2). - Vaclav Kotesovec, Nov 19 2012 a(n) ~ 3^(3*n-1)/2^(2*n+1). - Vaclav Kotesovec, Dec 29 2012 MATHEMATICA Table[Sum[Binomial[3k, k]Binomial[3n-3k-2, n-k-1], {k, 0, n-1}], {n, 0, 30}] (* Harvey P. Dale, Jan 10 2012 *) PROG (Haskell) a036829 n = sum \$ map (\k -> (a007318 (3*k) k) * (a007318 (3*n-3*k-2) (n-k-1))) [0..n-1] -- Reinhard Zumkeller, May 24 2012 CROSSREFS Cf. A006256. Cf. A007318, A036917. Sequence in context: A186161 A081106 A289785 * A164591 A242630 A004187 Adjacent sequences: A036826 A036827 A036828 * A036830 A036831 A036832 KEYWORD nonn AUTHOR N. J. A. Sloane 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 June 9 23:20 EDT 2023. Contains 363183 sequences. (Running on oeis4.)