|
|
A124349
|
|
Numbers of directed Hamiltonian cycles on the n-prism graph.
|
|
4
|
|
|
6, 12, 10, 16, 14, 20, 18, 24, 22, 28, 26, 32, 30, 36, 34, 40, 38, 44, 42, 48, 46, 52, 50, 56, 54, 60, 58, 64, 62, 68, 66, 72, 70, 76, 74, 80, 78, 84, 82, 88, 86, 92, 90, 96, 94, 100, 98, 104, 102, 108, 106, 112, 110, 116, 114, 120, 118, 124, 122, 128, 126, 132, 130
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2*n + (1-(n mod 2))*4.
a(n) = a(n-1)+a(n-2)-a(n-3).
G.f.: 2*x^3*(3+3*x-4*x^2)/((1-x)^2*(1+x)). (End)
E.g.f.: 2*(2 + x)*cosh(x) + 2*x*sinh(x) - 2*(2 + x + 2*x^2). - Stefano Spezia, Jan 28 2024
|
|
MAPLE
|
seq( 2*n + (1-(n mod 2))*4, n=3..100); # Robert Israel, Mar 14 2016
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) Vec(2*x^3*(3+3*x-4*x^2)/((1-x)^2*(1+x)) + O(x^100)) \\ Altug Alkan, Mar 14 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|