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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267634 Total number of nodes in a maximal connected component over all simple labeled graphs on n nodes. 0
 0, 1, 3, 19, 219, 4691, 188215, 14388823, 2128027015, 615859881223, 351128005027151, 395921495115621487, 885006516085472323279, 3928043932547284205971407, 34658076266993991201736109023, 608435086028952410310283975943071 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS In other words, a(n) is the total number of nodes in one maximal component of each of the graphs in A006125. LINKS MATHEMATICA nn = 15; a = Sum[2^Binomial[n, 2] x^n/n!, {n, 0, nn}]; b = Total[(Range[0, nn]! CoefficientList[Series[ Log[a], {x, 0, nn}],       x]) Table[x^i/i!, {i, 0, nn}]]; Map[Total, Transpose[   Table[Range[0, nn]! CoefficientList[Series[n (Exp[b[[1 ;; n]]] - Exp[b[[1 ;; n - 1]]]), {x, 0, nn}], x], {n, 1, nn}]]] CROSSREFS Cf. A006125. Sequence in context: A158876 A001833 A001035 * A277407 A271587 A217906 Adjacent sequences:  A267631 A267632 A267633 * A267635 A267636 A267637 KEYWORD nonn AUTHOR Geoffrey Critzer, Jan 18 2016 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 May 16 15:56 EDT 2022. Contains 353706 sequences. (Running on oeis4.)