|
Search: id:A003682
|
|
|
| A003682 |
|
Number of Hamiltonian paths in K_2 X P_n. |
|
+0
2
|
|
| 1, 4, 8, 14, 22, 32, 44, 58, 74, 92, 112, 134, 158, 184, 212, 242, 274, 308, 344, 382, 422, 464, 508, 554, 602, 652, 704, 758, 814, 872, 932, 994, 1058, 1124, 1192, 1262, 1334, 1408, 1484, 1562, 1642, 1724, 1808, 1894, 1982, 2072, 2164
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Equals row sums of triangle A144336 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 18 2008]
|
|
LINKS
|
F. Faase, Counting Hamilton cycles in product graphs
|
|
FORMULA
|
For n>1, a(n) = n^2 - n + 2.
Equals binomial transform of [1, 3, 1, 1, -1, 1, -1, 1,...]. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 23 2008
|
|
MAPLE
|
a:=n->sum(binomial(2, 2*j)+n, j=0..n): seq(a(n), n=0..46); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 22 2007
|
|
CROSSREFS
|
Equals A002061(n) + 1, n>1.
Adjacent sequences: A003679 A003680 A003681 this_sequence A003683 A003684 A003685
Sequence in context: A053459 A024398 A054347 this_sequence A011897 A110895 A049628
A144336 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 18 2008]
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Frans Faase (Frans_LiXia(AT)wxs.nl)
|
|
|
Search completed in 0.002 seconds
|
