login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075534 Number of increasing rooted trees where each node at height h has 0 or h+1 children. 2
1, 1, 0, 1, 0, 0, 5, 0, 0, 35, 189, 0, 0, 10395, 18018, 77616, 0, 5360355, 15338862, 72648576, 108636528, 4737022290, 47846771280, 84845128368, 833082788538, 6459731648370, 163728321649200, 767835548449200, 3922621945211970 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

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

LINKS

Table of n, a(n) for n=1..29.

Index entries for sequences related to rooted trees

CROSSREFS

Cf. A075532, A075533.

Sequence in context: A236232 A019178 A263913 * A221361 A083527 A221240

Adjacent sequences:  A075531 A075532 A075533 * A075535 A075536 A075537

KEYWORD

nonn

AUTHOR

Christian G. Bower, Sep 19 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 22:46 EST 2021. Contains 349445 sequences. (Running on oeis4.)