login
A114936
Number of connected (4,n)-hypergraphs (without empty edges).
6
0, 1, 10, 135, 1992, 30166, 458885, 6965225, 105358102, 1588998756, 23915093535, 359444209015, 5397938190512, 81022969645346, 1215801458118985, 18240857019892005, 273644796626023722, 4104936328561231936
OFFSET
0,3
LINKS
Goran Kilibarda and Vladeta Jovovic, Enumeration of some classes of T_0-hypergraphs, arXiv:1411.4187 [math.CO], 2014.
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) - 24*exp(4*x) + 23*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] - 24*Exp[4*x] + 23*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], Vec(serlaplace((1/4!)*(exp(15*x) - 4*exp(8*x) + 6*exp(7*x) - 3*exp(6*x) + 12*exp(5*x) - 24*exp(4*x) + 23*exp(3*x) - 11*exp(2*x) + 6*exp(x) - 6)))) \\ G. C. Greubel, Oct 07 2017
KEYWORD
easy,nonn
AUTHOR
Goran Kilibarda and Vladeta Jovovic, Jan 08 2006
STATUS
approved