Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108522
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108522 Number of increasing rooted trees with n generators. +0
3
1, 2, 9, 70, 771, 10948, 190205, 3907494, 92654059, 2490459468, 74827519077, 2485153213814, 90403692195179, 3574835773247140, 152675377606343901, 7003761877546096278, 343454890456254782203, 17929588055863943650988 (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) + exp(A(x))

CROSSREFS

Cf. A108521-A108529, A007151, A001147.

Adjacent sequences: A108519 A108520 A108521 this_sequence A108523 A108524 A108525

Sequence in context: A006849 A121417 A136738 this_sequence A014500 A101482 A099717

KEYWORD

nonn

AUTHOR

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

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research