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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A143603 Triangle, read by rows, such that the g.f. of column k = G(x)^(2k+1) where G(x) = 1 + x*G(x)^3 is the g.f. of A001764 (ternary trees). 4
1, 1, 1, 3, 3, 1, 12, 12, 5, 1, 55, 55, 25, 7, 1, 273, 273, 130, 42, 9, 1, 1428, 1428, 700, 245, 63, 11, 1, 7752, 7752, 3876, 1428, 408, 88, 13, 1, 43263, 43263, 21945, 8379, 2565, 627, 117, 15, 1, 246675, 246675, 126500, 49588, 15939, 4235, 910, 150, 17, 1 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

T(n,k) = C(3n-k,n-k)*(2k+1)/(2n+1) for 0<=k<=n.

Let M = the production matrix:

1, 1

2, 2, 1

3, 3, 2, 1

4, 4, 3, 2, 1

5, 5, 4, 3, 2, 1

...

Top row of M^(n-1) gives n-th row terms of triangle A143603. - Gary W. Adamson, Jul 07 2011

EXAMPLE

Triangle begins:

1;

1, 1;

3, 3, 1;

12, 12, 5, 1;

55, 55, 25, 7, 1;

273, 273, 130, 42, 9, 1;

1428, 1428, 700, 245, 63, 11, 1;

7752, 7752, 3876, 1428, 408, 88, 13, 1; ...

where g.f. of column k = G(x)^(2k+1) where G(x) = 1 + x*G(x)^3.

Matrix inverse begins:

1;

-1, 1;

0, -3, 1;

0, 3, -5, 1;

0, -1, 10, -7, 1;

0, 0, -10, 21, -9, 1;

0, 0, 5, -35, 36, -11, 1;

0, 0, -1, 35, -84, 55, -13, 1; ...

where g.f. of column k = (1-x)^(2k+1) for k>=0.

PROG

(PARI) {T(n, k)=binomial(3*n-k, n-k)*(2*k+1)/(2*n+1)}

CROSSREFS

Cf. columns: A001764, A102893, A102594; row sums: A006013.

Sequence in context: A050609 A120870 A010029 * A094021 A062746 A115193

Adjacent sequences:  A143600 A143601 A143602 * A143604 A143605 A143606

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 29 2008

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 15 16:28 EST 2012. Contains 205823 sequences.