Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030438
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030438 a(n) = A030019(n)*n! (or A035051*(n-1)!). +0
3
1, 1, 2, 24, 696, 37320, 3201840, 401914800, 69458497920, 15813882201600, 4587474713068800, 1651825133370720000, 722868238335090355200, 377862727500237858278400, 232536825223980698118297600 (list; graph; listen)
OFFSET

0,3

REFERENCES

Warren D. Smith and David Warme, Paper in preparation, 2002.

LINKS

Index entries for sequences related to rooted trees

FORMULA

a(n) = (n-1)! Sum_{i=0}^{n-1} Stirling2(n-1, i) n^i, n >= 1.

CROSSREFS

Cf. A030019, A035051.

Adjacent sequences: A030435 A030436 A030437 this_sequence A030439 A030440 A030441

Sequence in context: A012375 A012750 A009750 this_sequence A012723 A069150 A046977

KEYWORD

nonn

AUTHOR

David Warme (warme(AT)s3i.com)

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research