The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A011800 Number of labeled forests of n nodes each component of which is a path. 5
 1, 1, 2, 7, 34, 206, 1486, 12412, 117692, 1248004, 14625856, 187638716, 2614602112, 39310384192, 634148436104, 10923398137576, 200069534481616, 3882002527006352, 79535575126745632, 1715658099715217584 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 REFERENCES I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983, (3.3.6). R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 5.15(d). LINKS T. D. Noe, Table of n, a(n) for n = 0..100 Tobias Boege, Thomas Kahle, Construction Methods for Gaussoids, arXiv:1902.11260 [math.CO], 2019. Samuele Giraudo, Combalgebraic structures on decorated cliques, Formal Power Series and Algebraic Combinatorics, Séminaire Lotharingien de Combinatoire, 78B.15, 2017, p. 8, arXiv:1709.08416 [math.CO], 2017. J. Rasku, T. Karkkainen, P. Hotokka, Solution Space Visualization as a Tool for Vehicle Routing Algorithm Development, Proc. FORS-40, pp. 9-12, 2013. FORMULA E.g.f.: exp[ x + x^2/(2*(1 - x)) ]. a(n) = Sum_{k=0..n} |Stirling1(n, k)|*A003724(k). - Vladeta Jovovic, Oct 19 2003 Recurrence: 2*a(n) = 2*(2*n-1)*a(n-1) - 2*(n-1)^2*a(n-2) + (n-2)*(n-1)*a(n-3). - Vaclav Kotesovec, Oct 07 2012 a(n) ~ 2^(-3/4)*exp(sqrt(2*n)-n+1/4)*n^(n-1/4). - Vaclav Kotesovec, Oct 07 2012 a(n) = n!*Sum_{k=1..n} (Sum_{i=0..n-k} binomial(k,n-k-i)*binomial(k+i-1,k-1)*2^(-n+k+i)*(-1)^(n-k-i))/k!, n > 0, a(0) = 1. - Vladimir Kruchinin, Nov 25 2012 MATHEMATICA Function[ esl, esl*Array[ Factorial, Length[ esl ], 0 ] ][ CoefficientList[ Series[ Exp[ x+x^2/(2-2x) ], {x, 0, 20} ], x ] ] (* Olivier Gérard *) With[{nn=20}, CoefficientList[Series[Exp[x+x^2/(2*(1-x))], {x, 0, nn}], x] Range[ 0, nn]!] (* Harvey P. Dale, May 13 2019 *) PROG (Maxima) a(n):=n!*sum(sum(binomial(k, n-k-i)*binomial(k+i-1, k-1)*2^(-n+k+i)*(-1)^(n-k-i), i, 0, n-k)/(k!), k, 1, n); /* Vladimir Kruchinin, Nov 25 2012 */ CROSSREFS Sequence in context: A212027 A056543 A075834 * A112916 A145845 A002720 Adjacent sequences:  A011797 A011798 A011799 * A011801 A011802 A011803 KEYWORD nonn,easy,nice AUTHOR Herbert S. Wilf 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 December 5 16:22 EST 2020. Contains 338954 sequences. (Running on oeis4.)