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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052318 Number of labeled rooted trimmed trees with n nodes. 15
1, 2, 3, 16, 145, 1536, 19579, 290816, 4942305, 94689280, 2020278931, 47523053568, 1222147737265, 34117226135552, 1027550555918475, 33213871550365696, 1146891651823112641, 42135941698113503232 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

A rooted trimmed tree is a tree with a forbidden limb of length 2.

A rooted tree with a forbidden limb of length k is a rooted tree where the path from any leaf inward hits a branching node or the root within k steps.

LINKS

Index entries for sequences related to rooted trees

FORMULA

E.g.f. satisfies A(x)=x*exp(A(x)-x^2).

MAPLE

A:= proc(n) option remember; if n<=1 then x else convert (series (x* exp(A(n-1)-x^2), x, n), polynom) fi end: a:= n-> coeff (A(n+1), x, n)*n!: seq (a(n), n=1..18); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Aug 23 2008]

CROSSREFS

Cf. A002955, A002988-A002992, A052319-A052329.

Sequence in context: A139802 A063666 A006247 * A141309 A179442 A057997

Adjacent sequences:  A052315 A052316 A052317 * A052319 A052320 A052321

KEYWORD

nonn,eigen

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Dec 15 1999.

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 17 04:46 EST 2012. Contains 205985 sequences.