Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108525
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108525 Number of increasing ordered rooted trees with n generators. +0
2
1, 3, 27, 429, 9609, 277107, 9772803, 407452221, 19604840481, 1069202914083, 65177482634667, 4391636680582029, 324102772814580729, 25999541378465556627, 2252597527900572815763, 209625760563134613131421 (list; graph; listen)
OFFSET

1,2

COMMENT

A generator is a leaf or a node with just one child.

In an increasing rooted tree, nodes are numbered and numbers increase as you move away from root.

LINKS

Index entries for sequences related to rooted trees

FORMULA

E.g.f. satisfies 2*A(x) = x - 1 + A'(x) + 1/(1-A(x))

CROSSREFS

Cf. A108521-A108529, A001147.

Sequence in context: A141057 A011781 A094577 this_sequence A136719 A159600 A159601

Adjacent sequences: A108522 A108523 A108524 this_sequence A108526 A108527 A108528

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jun 07 2005

page 1

Search completed in 0.003 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