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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114933 Number of connected (4,n)-hypergraphs (without empty edges and without multiple edges). 3
0, 0, 0, 32, 1094, 23055, 405475, 6575842, 102567444, 1569195485, 23775369725, 358461659952, 5391042181294, 80974624209115, 1215462744452775, 18238484835400862, 273628186560143144, 4104820038944901945 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

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..845

FORMULA

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

MATHEMATICA

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

PROG

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

CROSSREFS

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

Sequence in context: A265021 A159360 A249392 * A038097 A208267 A184758

Adjacent sequences:  A114930 A114931 A114932 * A114934 A114935 A114936

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 1 04:13 EDT 2022. Contains 354951 sequences. (Running on oeis4.)