|
Search: id:A003691
|
|
|
| A003691 |
|
Number of spanning trees with degrees 1 and 3 in K_3 X P_2n. |
|
+0
1
|
|
| 3, 36, 324, 2880, 25632, 228096, 2029824, 18063360, 160745472, 1430470656, 12729729024, 113281597440, 1008090611712, 8970977673216, 79832546279424, 710428191621120
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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) = 8a(n-1) + 8a(n-2), n>2.
|
|
CROSSREFS
|
Cf. A057091.
Sequence in context: A056299 A073980 A034860 this_sequence A038146 A067444 A092648
Adjacent sequences: A003688 A003689 A003690 this_sequence A003692 A003693 A003694
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
|
Search completed in 0.002 seconds
|
