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!)
A093853 Number of 3-uniform T_0-hypergraphs without multiple edges on n vertices. 1

%I #9 Jan 29 2020 14:06:36

%S 1,1,0,0,5,918,1045305,34359063140,72057592159917465,

%T 19342813113675737866540892,1329227995784915042800342940013202739,

%U 46768052394588893381973221029683604571061797713236,1684996666696914987166688353104182049991595860118136923187291272117

%N Number of 3-uniform T_0-hypergraphs without multiple edges on n vertices.

%H Andrew Howroyd, <a href="/A093853/b093853.txt">Table of n, a(n) for n = 0..25</a>

%F E.g.f.: (1+x)*exp(-x+x^2/2+x^3/3)*Sum_{n>=0} (2^binomial(n, 3)*exp(-2^(n-1)*x^2)*x^n/n!.

%o (PARI) seq(n)={Vec(serlaplace((1 + x)*exp(-x + x^2/2 + x^3/3 + O(x*x^n))*sum(k=0, n, 2^binomial(k, 3)*exp(-2^(k-1)*x^2 + O(x*x^(n-k)))*x^k/k!)))} \\ _Andrew Howroyd_, Jan 29 2020

%Y Cf. A094630, A094631.

%K nonn

%O 0,5

%A Goran Kilibarda, _Vladeta Jovovic_, May 21 2004

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 April 24 19:39 EDT 2024. Contains 371963 sequences. (Running on oeis4.)