This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A210661 The total number of ways to linearly order the connected components of each functional digraph over all functions f:{1,2,...,n}->{1,2,...,n}. 0
 1, 1, 5, 41, 464, 6679, 116534, 2387223, 56126216, 1488936405, 43981641232, 1431351648253, 50877935705904, 1960987188622955, 81454893191133968, 3627186997857749259, 172364960657294194944, 8705953783492490785801, 465732966748611591349632, 26305402198153236286685809, 1564288763576093814775234304 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Sum_{k=1,2,...,n}:A060281(n,k)*k! LINKS FORMULA E.g.f.: 1/(1-log(1/(1-T(x)))) where T(x) is the e.g.f. for A000169. a(n) ~ n! * exp((2*n*exp(1)-exp(1)-n)*exp(-1))/(exp(1)-1)^(n+1). - Vaclav Kotesovec, Sep 24 2013 MATHEMATICA nn=20; t=Sum[n^(n-1)x^n/n!, {n, 1, nn}]; a=Log[1/(1-t)]; Range[0, nn]!CoefficientList[Series[1/(1-a), {x, 0, nn}], x] CROSSREFS Sequence in context: A222081 A047735 A096364 * A049119 A305981 A032188 Adjacent sequences:  A210658 A210659 A210660 * A210662 A210663 A210664 KEYWORD nonn AUTHOR Geoffrey Critzer, Mar 30 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 04:40 EDT 2019. Contains 328211 sequences. (Running on oeis4.)