The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A131313 Number of labeled 4-arch graphs on n nodes. 0
 0, 0, 0, 1, 1, 15, 1085, 216230, 92550276, 74358276300, 102660061574400, 228311514581611725, 777903709095959606875, 3900045557544532389044051, 27829438251904221299882526375, 274842860343937013061411903607000, 3668195394384971166861021308091920000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Saverio Caminiti and Emanuele G. Fusco, On the Number of Labeled k-arch Graphs, Journal of Integer Sequences, Vol 10 (2007), Article 07.7.5 FORMULA The number of labeled 4-arch graphs with n>5 nodes is given by f(n,4,n-4-1,0,4) where f is the recursive function described by the pari-gp code attached below. PROG (PARI) f(n, k, i, u, j)={ local(s=0); if (i==1, binomial(n-u, j)*binomial(u, k-j), for (c=0, min(k, n-(i-1)-(u+j)), s+=f(n, k, i-1, u+j, c) ); binomial(n-u, j)*binomial(u, k-j)*s ) } CROSSREFS Cf. A098721-A098724, A131311-A131315. Sequence in context: A206162 A203409 A207980 * A208346 A236329 A129764 Adjacent sequences:  A131310 A131311 A131312 * A131314 A131315 A131316 KEYWORD nonn AUTHOR Saverio Caminiti and Emanuele G. Fusco (fusco(AT)di.uniroma1.it), Sep 18 2007 EXTENSIONS Edited by N. J. A. Sloane, Oct 02 2007 Terms a(11) and beyond from Andrew Howroyd, Nov 07 2019 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.

Last modified December 4 15:27 EST 2020. Contains 338927 sequences. (Running on oeis4.)