|
Search: id:A005389
|
|
|
| A005389 |
|
Number of Hamiltonian circuits on 2n times 4 rectangle.
(Formerly M4228)
|
|
+0
1
|
|
| 1, 6, 37, 236, 1517, 9770, 62953, 405688, 2614457, 16849006, 108584525, 699780452, 4509783909, 29063617746, 187302518353, 1207084188912, 7779138543857, 50133202843990
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
T. G. Schmalz, G. E. Hite and D. J. Klein, Compact self-avoiding circuits on two-dimensional lattices, J. Phys. A 17 (1984), 445-453.
|
|
LINKS
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
|
|
FORMULA
|
G.f.: (1-2x-x^2)/(1-8x+10x^2+x^4). - Ralf Stephan, Apr 23 2004
|
|
MAPLE
|
A005389:=-(-1+2*z+z**2)/(1-8*z+10*z**2+z**4); [Conjectured by S. Plouffe in his 1992 dissertation.]
(Maple) a := n -> (Matrix([[0, 1, 2, -11]]). Matrix(4, (i, j)-> if (i=j-1) then 1 elif j=1 then [8, -10, 0, -1][i] else 0 fi)^(n))[1, 1]; seq (a(n), n=1..18); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Aug 05 2008]
|
|
CROSSREFS
|
Bisection of A006864.
Sequence in context: A081912 A081188 A154623 this_sequence A080954 A073013 A140712
Adjacent sequences: A005386 A005387 A005388 this_sequence A005390 A005391 A005392
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
|
Search completed in 0.002 seconds
|
