login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130579 Convolution of A000108 (Catalan numbers) and A001764 (ternary trees): a(n) = Sum_{k=0..n} C(2k,k) * C(3(n-k),n-k) / [(k+1)(2(n-k)+1)]. 0
1, 2, 6, 22, 92, 423, 2087, 10856, 58765, 327877, 1872490, 10890483, 64267612, 383773529, 2314271146, 14071475748, 86165249745, 530862665988, 3288219482754, 20464419717069, 127901478759153, 802421158028657 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

G.f.: A(x) = C(x)*T(x) where C(x) = 1 + x*C(x)^2 is the g.f. of A000108 and T(x) = 1 + x*T(x)^3 is the g.f. of A001764.

PROG

(PARI) a(n)=sum(k=0, n, binomial(2*k, k)/(k+1)*binomial(3*(n-k), n-k)/(2*(n-k)+1))

CROSSREFS

Cf. A000108, A001764.

Sequence in context: A155866 A150273 A001181 * A107945 A014330 A124294

Adjacent sequences:  A130576 A130577 A130578 * A130580 A130581 A130582

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 07 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.