|
| |
|
|
A003756
|
|
Number of spanning trees with degrees 1 and 3 in S_4 X P_{2n-1}.
|
|
0
| |
|
|
1, 0, 24, 54, 492, 1944, 11976, 57024, 313440, 1587168, 8417472, 43483392, 227995008, 1185394176, 6192642048, 32263570944, 168350991360, 877689686016, 4578049517568
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.
|
|
|
LINKS
| F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Preliminary version of paper that appeared in Ars Combin. 49 (1998), 129-154.
F. Faase, Counting Hamilton cycles in product graphs
F. Faase, Results from the counting program
F. Faase, Counting Hamilton cycles in product graphs
Index entries for sequences related to trees
|
|
|
FORMULA
| a(n) = 2a(n-1) + 16a(n-2) + 4a(n-3), n>4.
G.f.: x(1+8x^2+2x^3-2x)/(1-2x-16x^2-4x^3). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 16 2008]
|
|
|
CROSSREFS
| Sequence in context: A108215 A038635 A005782 * A135191 A039375 A043198
Adjacent sequences: A003753 A003754 A003755 * A003757 A003758 A003759
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Frans Faase (Frans_LiXia(AT)wxs.nl). Corrections Feb 07 2009.
|
| |
|
|
