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!)
A093854 Triangle read by rows: T(n,m) = number of 3-uniform T_0-hypergraphs with n distinct edges and m vertices(n>=3, 1<=m<=2*n+1). 0

%I #4 May 10 2013 12:45:31

%S 0,0,0,4,80,480,840,0,0,0,1,200,3840,27720,77280,45360,0,0,0,0,252,

%T 14664,263844,2192400,8709120,13819680,3991680,0,0,0,0,210,38340,

%U 1518790,26267360,240765840,1205492400,3068881200,3180038400,605404800

%N Triangle read by rows: T(n,m) = number of 3-uniform T_0-hypergraphs with n distinct edges and m vertices(n>=3, 1<=m<=2*n+1).

%F E.g.f.: (1+x)*exp(-x+x^2/2+x^3/3*y)*Sum((1+y)^binomial(n, 3)*exp(-x^2*(1+y)^n/2)*x^n/n!, n=0..infinity).

%e 0,0,0,4,80,480,840; 0,0,0,1,200,3840,27720,77280,45360; 0,0,0,0,252,14664,263844,2192400,8709120,13819680,3991680; ...

%K nonn,tabf

%O 3,4

%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 25 09:17 EDT 2024. Contains 371967 sequences. (Running on oeis4.)