|
Search: id:A070968
|
|
|
| A070968 |
|
Number of cycles in the bipartite graph K(n,n). |
|
+0
2
|
|
| 0, 1, 15, 204, 3940, 113865, 4662231, 256485040, 18226108944, 1623855701385, 177195820499335, 23237493232953516, 3605437233380095620, 653193551573628900289, 136634950180317224866335
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
a(n) = sum k=2..n C(n, k)^2 * k! * (k-1)! / 2.
|
|
MATHEMATICA
|
Table[ Sum[ Binomial[n, k]^2*k!*(k - 1)!, {k, 2, n}]/2, {n, 1, 17}]
|
|
PROGRAM
|
(PARI) for(n=1, 50, print1(sum(k=2, n, binomial(n, k)^2 * k! * (k-1)!/2), ", "))
|
|
CROSSREFS
|
Cf. A002807, A068087.
Sequence in context: A048444 A002007 A012566 this_sequence A075280 A093747 A061637
Adjacent sequences: A070965 A070966 A070967 this_sequence A070969 A070970 A070971
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Sharon Sela (sharonsela(AT)hotmail.com), May 17 2002
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr) and Robert G. Wilson v (rgwv(AT)rgwv.com), May 20 2002
|
|
|
Search completed in 0.002 seconds
|
