OFFSET
0,2
COMMENTS
This is the number of spanning, connected subgraphs of the "ladder graph" of n squares (ladder graph = the vertices and edges of the tiling of a 1 X n rectangle by unit squares). - David Pasino (davepasino(AT)yahoo.com), Sep 18 2007
a(n) equals the number of words of length n over {0,1,2,3,4} avoiding 01 and 02. - Milan Janjic, Dec 17 2015
REFERENCES
S. J. Cyvin and I. Gutman, Kekulé structures in benzenoid hydrocarbons, Lecture Notes in Chemistry, No. 46, Springer, New York, 1988 (see p. 78).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1000
Tomislav Doslic, Planar polycyclic graphs and their Tutte polynomials, Journal of Mathematical Chemistry, Volume 51, Issue 6, 2013, pp. 1599-1607. See Cor. 3.7(e).
A. M. Hinz, S. Klavžar, U. Milutinović, C. Petr, The Tower of Hanoi - Myths and Maths, Birkhäuser 2013. See page 117. Book's website
Index entries for linear recurrences with constant coefficients, signature (5,-2).
FORMULA
a(n) = [M^(n+1)]_1,2, where M is the 3 X 3 matrix defined as follows: M = [2,1,2; 1,1,1; 2,1,2]. - Simone Severini, Jun 12 2006
a(n) = (((5 + s)/2)^(n+1) - ((5 - s)/2)^(n+1))/s with s = 17^(1/2). - David Pasino (davepasino(AT)yahoo.com), Jan 09 2009
G.f.: 1/(1 - 5*x + 2*x^2). - R. J. Mathar, Apr 07 2009
MAPLE
a:= n-> (<<0|1>, <-2|5>>^n)[2$2]:
seq(a(n), n=0..25); # Alois P. Heinz, Nov 21 2020
MATHEMATICA
a[n_]:=(MatrixPower[{{1, 2}, {1, 4}}, n].{{1}, {1}})[[2, 1]]; Table[a[n], {n, 0, 40}] (* Vladimir Joseph Stephan Orlovsky, Feb 19 2010 *)
PROG
(Sage) [lucas_number1(n, 5, 2) for n in range(27)] # Zerinvary Lajos, Jun 25 2008
(Magma) I:=[1, 5]; [n le 2 select I[n] else 5*Self(n-1)-2*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Dec 17 2015
(PARI) Vec(1/(1-5*x+2*x^2) + O(x^100)) \\ Altug Alkan, Dec 17 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Emeric Deutsch, Jun 12 2005
STATUS
approved