|
Search: id:A152188
|
|
|
| A152188 |
|
Number of broadcast schemes in the complete graph on n vertices, K_{n}. |
|
+0
1
|
|
| 1, 2, 12, 120, 1680, 30240, 665280, 17297280, 518918400, 17643225600, 670442572800, 28158588057600, 1295295050649600, 64764752532480000, 3497296636753920000, 202843204931727360000, 12576278705767096320000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Calin D. Morosan, On the number of broadcast schemes in networks, Information Processing Letters, Volume 100, Issue 5 (2006), 188-193.
|
|
FORMULA
|
SB(K_{n})=(2n-2)!/(n-1)!
a(n)=A001813(n-1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 13 2008]
|
|
MATHEMATICA
|
Clear[f]; f[n_]:=Factorial[2n-2]/Factorial[n-1]; Do[Print[f[i]], {i, 1, 20, 1}]
|
|
CROSSREFS
|
Related to A001813 and A097388.
Sequence in context: A108135 A001813 A097388 this_sequence A131815 A047793 A048800
Adjacent sequences: A152185 A152186 A152187 this_sequence A152189 A152190 A152191
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Calin D. Morosan (cd_moros(AT)alumni.concordia.ca), Nov 28 2008
|
|
|
Search completed in 0.002 seconds
|
