OFFSET
0,2
LINKS
Colin Barker, Table of n, a(n) for n = 0..900
Tomislav Došlić and Frode Måløy, Chain hexagonal cacti: Matchings and independent sets, Discr. Math., 310 (2010), 1676-1690.
Index entries for linear recurrences with constant coefficients, signature (13,-10).
FORMULA
From Colin Barker, Jan 13 2020: (Start)
a(n) = 13*a(n-1) - 10*a(n-2) for n>1.
a(n) = 2^(-1-n)*((13-sqrt(129))^n*(-23+sqrt(129)) + (13+sqrt(129))^n*(23+sqrt(129))) / sqrt(129).
(End)
MATHEMATICA
CoefficientList[Series[(1+5x)/(1-13x+10x^2), {x, 0, 20}], x] (* or *) LinearRecurrence[{13, -10}, {1, 18}, 20] (* Harvey P. Dale, Mar 23 2022 *)
PROG
(Magma) R<x>:=PowerSeriesRing(Integers(), 25); Coefficients(R!( (1+5*x)/(1-13*x+10*x^2) )); // Marius A. Burtea, Jan 13 2020
(Magma) a:=[1, 18]; [n le 2 select a[n] else 13*Self(n-1)-10*Self(n-2):n in [1..25]]; // Marius A. Burtea, Jan 13 2020
(PARI) Vec((1 + 5*x) / (1 - 13*x + 10*x^2) + O(x^20)) \\ Colin Barker, Jan 13 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 22 2010
STATUS
approved