Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000950
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000950 Number of forests with n nodes and height at most 3.
(Formerly M3025 N1225)
+0
3
1, 3, 16, 125, 1176, 12847, 160504, 2261289, 35464816, 612419291, 11539360944, 235469524237, 5170808565976, 121535533284999, 3043254281853496, 80852247370051793, 2270951670959226336, 67221368736302224819 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

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

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)))).

CROSSREFS

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

Sequence in context: A005119 A090135 A157457 this_sequence A000951 A000272 A159594

Adjacent sequences: A000947 A000948 A000949 this_sequence A000951 A000952 A000953

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

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 November 21 21:21 EST 2009. Contains 167310 sequences.


AT&T Labs Research