Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000951
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000951 Number of forests with n nodes and height at most 4.
(Formerly M3026 N1226)
+0
12
1, 3, 16, 125, 1296, 16087, 229384, 3687609, 66025360, 1303751051, 28151798544, 659841763957, 16681231615816, 452357366282655, 13095632549137576, 403040561722348913, 13138626717852194976, 452179922268565180819 (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*exp(x*exp(x))))).

CROSSREFS

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

Sequence in context: A005119 A090135 A000950 this_sequence A000272 A088358 A082161

Adjacent sequences: A000948 A000949 A000950 this_sequence A000952 A000953 A000954

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 August 29 16:58 EDT 2008. Contains 143238 sequences.


AT&T Labs Research