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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006959 Number of labeled M-type rooted trees on n nodes.
(Formerly M4274)
1
1, 6, 65, 1092, 25272, 749034, 27108440, 1159194472, 57190952440, 3197759266112, 199831490658912, 13802087001056704, 1044075809166477232, 85847947926743165952, 7623428923066363040672, 727116625218755662644416 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

F. Bergeron, G. Labelle and P. Leroux, Th\'{e}orie des esp\`{e}ces et Combinatoire des Structures Arborescentes, Publications du LACIM, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1994, p. 214.

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, pp. 210, 242 (3.2.68, 3.3.92)

G. Labelle, Some new computational methods in the theory of species, pp. 192-209 of "Combinatoire Enumerative (Montreal 1985)", Lect. Notes Math. 1234, 1986.

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

LINKS

Index entries for sequences related to rooted trees

FORMULA

E.g.f. satisfies 2*A(x)=exp(x+A(x))-1-log(1-x)*A(x).

CROSSREFS

Cf. A052315.

Sequence in context: A179879 A099343 A189509 * A121017 A137121 A110222

Adjacent sequences:  A006956 A006957 A006958 * A006960 A006961 A006962

KEYWORD

nonn,eigen,nice

AUTHOR

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

EXTENSIONS

More terms, formula from Christian G. Bower (bowerc(AT)usa.net), Dec 15 1999.

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 16 21:51 EST 2012. Contains 205978 sequences.