|
Search: id:A006237
|
|
|
| A006237 |
|
Complexity of tensor sum of n graphs; or spanning trees on n-cube.
(Formerly M3725)
|
|
+0
2
|
|
| 1, 1, 4, 384, 42467328, 20776019874734407680, 1657509127047778993870601546036901052416000000, 153850844349814660487100539994381178281567942393055761257560677644718869248475136000000000000000000000
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
G. Kreweras, Complexite et circuits Euleriens dans la sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212.
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.6.10.
|
|
LINKS
|
Index entries for sequences related to trees
|
|
FORMULA
|
a(n) = 2^(2^n-1-n)*1^binomial(n, 1)*2^binomial(n, 2)*...*n^binomial(n, n).
|
|
PROGRAM
|
(PARI) a(n)=2^(2^n-n-1)*prod(k=1, n, k^binomial(n, k))
|
|
CROSSREFS
|
Cf. A006235.
Sequence in context: A051181 A038015 A003753 this_sequence A116031 A115049 A036771
Adjacent sequences: A006234 A006235 A006236 this_sequence A006238 A006239 A006240
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas, D. E. Knuth
|
|
EXTENSIONS
|
Description expanded 7/95.
|
|
|
Search completed in 0.002 seconds
|
