|
Search: id:A003689
|
|
|
| A003689 |
|
Number of Hamiltonian paths in K_3 X P_n. |
|
+0
1
|
|
| 3, 30, 144, 588, 2160, 7440, 24576, 78912, 248448, 771456, 2371968, 7241856, 21998976, 66586752, 201025920, 605781120, 1823094144, 5481472128, 16470172032, 49464779904, 148508372352, 445764192384, 1337792747904
(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
|
|
FORMULA
|
a(n) = 7a(n-1) - 16a(n-2) + 12a(n-3), n>5.
128 * 3^(n-2) - (21n + 57) * 2^(n-2), n>2. - R. Stephan, Sep 26 2004
G.f.: 3x(1+3x-6x^2+8x^3-4x^4)/((1-3x)(1-2x)^2). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 16 2008]
|
|
CROSSREFS
|
Sequence in context: A031205 A020874 A161806 this_sequence A127868 A002463 A013281
Adjacent sequences: A003686 A003687 A003688 this_sequence A003690 A003691 A003692
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
|
Search completed in 0.002 seconds
|
