|
Search: id:A124353
|
|
|
| A124353 |
|
Number of (directed) Hamiltonian circuits on the n-antiprism graph. |
|
+0
4
|
|
| 32, 58, 112, 220, 450, 938, 1982, 4220, 9022, 19332, 41472, 89022, 191150, 410506, 881656, 1893634, 4067256, 8735972, 18763898, 40302866, 86566390, 185935764, 399371142, 857808780, 1842486536, 3957474934, 8500256470, 18257692546, 39215680080, 84231321290, 180920373632, 388598695916
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
LINKS
|
Mordecai J. Golin and Yiu Cho Leung, Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees, Hamiltonian Cycles and other Parameters. Technical report HKUST-TCSC-2004-02.
Eric Weisstein's World of Mathematics, Antiprism Graph
Eric Weisstein's World of Mathematics, Hamiltonian Circuit
|
|
FORMULA
|
a(n) = 2*(n + 3*A000930(2*n) - 2*A000930(2*n)) = A137725(2*n) = 2*A137726(2*n)
a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3) + a(n-5) or a(n) = 2*a(n-1) + a(n-2) - a(n-3) - a(n-4) - 12.
O.g.f.: -18*x^2-6*x-6+(4*x^2+4*x-6)/(x^3+2*x^2+x-1)+4/(x-1)^2+4/(x-1) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 10 2008
|
|
CROSSREFS
|
Cf. A124352.
Sequence in context: A033907 A033549 A117478 this_sequence A008434 A130447 A116284
Adjacent sequences: A124350 A124351 A124352 this_sequence A124354 A124355 A124356
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), Oct 27, 2006
|
|
EXTENSIONS
|
Formulas and further terms from Max Alekseyev (maxal(AT)cs.ucsd.edu), Feb 8, 2008
|
|
|
Search completed in 0.002 seconds
|
