The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A335356 Number of ways to linearly order the connected components of a simple labeled graph on n nodes. 1
 1, 1, 3, 16, 136, 1878, 47370, 2510396, 291566024, 71549525888, 35928299706224, 36432215193597408, 74229008389424439216, 303202179866531643034192, 2480138500144153722933893296, 40602085162301271195431005565536, 1329878225405871291410633661227157760 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..16. FORMULA E.g.f.: 1/(1-log(g(x))), where g(x) is the e.g.f. for A006125. MATHEMATICA nn = 16; g[x_] := Sum[2^Binomial[n, 2] x^n/n!, {n, 0, nn}]; Table[n!, {n, 0, nn}] CoefficientList[Series[1/(1 - Log[g[x]]), {x, 0, nn}], x] CROSSREFS Cf. A006125, A001187, A335378. Sequence in context: A247770 A357088 A277673 * A135746 A345349 A230320 Adjacent sequences: A335353 A335354 A335355 * A335357 A335358 A335359 KEYWORD nonn AUTHOR Geoffrey Critzer, Jun 04 2020 STATUS approved

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

Last modified June 5 03:05 EDT 2023. Contains 363130 sequences. (Running on oeis4.)