login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086677 Number of Steiner topologies on n points. 1
1, 4, 31, 360, 5625, 110880, 2643795, 74035080, 2382538725, 86656878000, 3515761193175, 157425426358200, 7711961781949425, 410298436511964000, 23559634669682986875, 1452240056377167057000, 95649328231839993736125 (list; graph; refs; listen; history; internal format)
OFFSET

2,2

REFERENCES

F. K. Hwang, D. S. Richards and P. Winter, The Steiner Tree Problem, North-Holland, 1992, see p. 14.

FORMULA

Let f(n) = (2*n-4)!/(2^(n-2)*(n-2)!) (A001147) and let F(n, k) = binomial(n, k+2) f(k) (n+k-2)! / (2k)!. Then a(n) = Sum_{k=0..n-2} Sum_{i=0..floor((n-k-2)/2)} binomial(n, i) F(n-i, k+i) (k+i)! / k!.

E.g.f.: 4*(x-3)/(x+1)^4 - (-13+22*x+3*x^2)/((-x^2-4*x+1)^(1/2)*(x+1)^4). - Mark van Hoeij, Oct 31 2011

CROSSREFS

Cf. A001147.

Sequence in context: A102757 A145561 A201628 * A016036 A000314 A128709

Adjacent sequences:  A086674 A086675 A086676 * A086678 A086679 A086680

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jul 28 2003

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 29 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.