Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135413
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135413 Number of at most 4-way branching ordered (i.e. plane) trees. +0
1
1, 2, 6, 20, 70, 246, 875, 3144, 11385, 41470, 151778, 557712, 2056210, 7602700, 28180050, 104677280, 389571983, 1452293766, 5422187130, 20271296100, 75878518695, 284339792110, 1066585128810, 4004566131000, 15048213795600 (list; graph; listen)
OFFSET

1,2

COMMENT

Obtained by Lagrange inversion of the generating function for at most k-way branching trees.

Solve z = T/(1+T+...T^k) when k = 4. I.e. the nth term is the coefficient of x^{n-1} in the expansion of (1+x+x^2+x^3+x^4)^n

MAPLE

A135413 := proc(n) local ogf, i ; ogf := 1 ; for i from 1 to n do ogf := taylor(ogf*(1+x+x^2+x^3+x^4), x=0, n) ; od: coeftayl(ogf, x=0, n-1) ; end: seq(A135413(n), n=1..30) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 21 2008

CROSSREFS

For k=2 this is A005717, for k=3 this is A005726.

Sequence in context: A148479 A150124 A045631 this_sequence A147748 A150125 A065345

Adjacent sequences: A135410 A135411 A135412 this_sequence A135414 A135415 A135416

KEYWORD

nonn,easy

AUTHOR

Andrey Bovykin (indiscernibles(AT)googlemail.com), Mar 01 2008

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 21 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research