This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A299353 Number of labeled connected uniform hypergraphs spanning n vertices. 13
 1, 1, 1, 5, 50, 1713, 1101990, 68715891672, 1180735735356264714926, 170141183460507906731293351306487161569, 7237005577335553223087828975127304177495735363998991435497132228228565768846 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS A hypergraph is uniform if all edges have the same size. Let T be the regular triangle A299354, where column k is the logarithmic transform of the inverse binomial transform of c(d) = 2^binomial(d,k). Then a(n) is the sum of row n. LINKS Wikipedia, Hypergraph EXAMPLE The a(3) = 5 hypergraphs: {{1,2,3}} {{1,2},{1,3}} {{1,2},{2,3}} {{1,3},{2,3}} {{1,2},{1,3},{2,3}} MATHEMATICA nn=10; Table[Sum[SeriesCoefficient[Log[Sum[x^m/m!*(-1)^(m-d)*Binomial[m, d]*2^Binomial[d, k], {m, 0, n}, {d, 0, m}]], {x, 0, n}]*n!, {k, n}], {n, nn}] CROSSREFS Cf. A000005, A001315, A006126, A006129, A038041, A048143, A298422, A299354, A299471, A306020, A306021. Sequence in context: A051893 A247951 A082100 * A180976 A305844 A303132 Adjacent sequences:  A299350 A299351 A299352 * A299354 A299355 A299356 KEYWORD nonn AUTHOR Gus Wiseman, Jun 18 2018 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 April 21 20:03 EDT 2019. Contains 322328 sequences. (Running on oeis4.)