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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132055 Tenth column of triangle A035342. 0
1, 165, 16665, 1349205, 97026930, 6526750230, 423076603950, 26922666320550, 1702498733310375, 107876426221438875, 6888889247523458175, 445180690239692281875, 29198763785973826044000 (list; graph; refs; listen; history; internal format)
OFFSET

10,2

COMMENTS

a(n), n>=10, enumerates unordered forests composed of nine plane ternary trees with n vertices. See A001147 (number of increasing ternary trees) and a D. Callan comment there. For a picture of some ternary trees see a W. Lang link under A001764.

a(n), n>=10, enumerates unordered forests composed of ten plane increasing ternary trees with n vertices. See A001147 (number of increasing ternary trees) and a D. Callan comment there. For a picture of some ternary trees see a W. Lang link under A001764.

FORMULA

E.g.f. ((x*c(x/2)*(1-2*x)^(-1/2))^10)/10!, where c(x) = g.f. for Catalan numbers A000108, a(0) := 0.

E.g.f. (-1+(1-2*x)^(-1/2))^10/10!.

EXAMPLE

a(11)=165=3*binomial(11,2) increasing ternary 10-forest with n=11 vertices: there are three 10-forests (nine one vertex trees together with any of the three different 2-vertex trees) each with binomial(11,2)= 55 increasing labelings.

CROSSREFS

Cf. A132054 (eighth column).

Sequence in context: A105944 A071576 A140912 * A046178 A176018 A184287

Adjacent sequences:  A132052 A132053 A132054 * A132056 A132057 A132058

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) Sep 14 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 16 09:56 EST 2012. Contains 205904 sequences.