Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000949
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000949 Number of forests with n nodes and height at most 2.
(Formerly M3021 N1223)
+0
12
1, 3, 16, 101, 756, 6607, 65794, 733833, 9046648, 121961051, 1782690174, 28055070397, 472594822324, 8479144213191, 161340195463066, 3243707386310033, 68679247688467056, 1526976223741111987 (list; graph; listen)
OFFSET

1,2

REFERENCES

J. Riordan, Forests of labeled trees, J. Combin. Theory, 5 (1968), 90-103.

FORMULA

E.g.f.: exp(x*exp(x*exp(x))).

CROSSREFS

Cf. A000248, A000950, A000951, A052512-A052514.

Sequence in context: A137572 A009151 A009007 this_sequence A091637 A074542 A105622

Adjacent sequences: A000946 A000947 A000948 this_sequence A000950 A000951 A000952

KEYWORD

nonn

AUTHOR

njas

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 07 2001

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 December 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research