login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114935 Number of connected (3,n)-hypergraphs (without empty edges). 3
0, 1, 6, 44, 332, 2476, 18136, 130824, 933372, 6610676, 46603616, 327603904, 2298933412, 16115938476, 112906938696, 790735321784, 5536710117452, 38763269947876, 271368229299376, 1899679393564464, 13298164198917492 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

REFERENCES

G. Kilibarda and V. Jovovic, "Enumeration of some classes of T_0-hypergraphs", in preparation, 2004.

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

FORMULA

E.g.f.: (1/3!)*(exp(7*x) -3*exp(4*x) +5*exp(3*x) -3*exp(2*x) +2*exp(x) - 2).

MATHEMATICA

With[{nmax = 50}, CoefficientList[Series[(1/3!)*(Exp[7*x] - 3*Exp[4*x] + 5*Exp[3*x] - 3*Exp[2*x] + 2*Exp[x] - 2), {x, 0, nmax}], x] Range[0, nmax]!] (* G. C. Greubel, Oct 07 2017 *)

PROG

(PARI) x='x+O('x^50); concat([0], Vec(serlaplace((1/3!)*(exp(7*x) -3*exp(4*x) +5*exp(3*x) -3*exp(2*x) +2*exp(x) - 2)))) \\ G. C. Greubel, Oct 07 2017

CROSSREFS

Cf. A002501, A002502, A093732, A093732-A114934, A114936, A114937.

Sequence in context: A189800 A227665 A102591 * A115969 A082412 A108452

Adjacent sequences:  A114932 A114933 A114934 * A114936 A114937 A114938

KEYWORD

easy,nonn

AUTHOR

Goran Kilibarda, Vladeta Jovovic, Jan 08 2006

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 10:46 EDT 2019. Contains 322330 sequences. (Running on oeis4.)