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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000951 Number of forests with n nodes and height at most 4.
(Formerly M3026 N1226)
12
1, 3, 16, 125, 1296, 16087, 229384, 3687609, 66025360, 1303751051, 28151798544, 659841763957, 16681231615816, 452357366282655, 13095632549137576, 403040561722348913, 13138626717852194976, 452179922268565180819 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

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

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

FORMULA

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

CROSSREFS

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

Sequence in context: A188417 A157457 A000950 * A000272 A159594 A188805

Adjacent sequences:  A000948 A000949 A000950 * A000952 A000953 A000954

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 07 2001

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 12 18:02 EST 2012. Contains 205432 sequences.