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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000439 Powers of rooted tree enumerator.
(Formerly M4608 N1965)
1
9, 30, 69, 133, 230, 369, 560, 814, 1143, 1560, 2079, 2715, 3484, 4403, 5490, 6764, 8245, 9954, 11913, 14145, 16674, 19525, 22724, 26298, 30275, 34684, 39555 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 150.

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

LINKS

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

FORMULA

a(n) = (n^4 + 18*n^3 + 83*n^2 + 114*n)/24 . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Feb 13 2004

MAPLE

A000439:=(2*z-3)*(z**2-3*z+3)/(z-1)**5; [Conjectured by S. Plouffe in his 1992 dissertation.]

CROSSREFS

Sequence in context: A073399 A005919 A084370 * A002414 A000440 A161684

Adjacent sequences:  A000436 A000437 A000438 * A000440 A000441 A000442

KEYWORD

nonn,easy

AUTHOR

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

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 13 23:23 EST 2012. Contains 205567 sequences.