OFFSET
0,6
COMMENTS
Lesser of number of closed walks of length n from a node on a pentagon and number of walks of length n between two adjacent nodes on a pentagon.
LINKS
Index entries for linear recurrences with constant coefficients, signature (2, 3, -6, -1, 2).
FORMULA
a(n)= 2*a(n-1) +3*a(n-2) -6*a(n-3) -a(n-4) +2*a(n-5). G.f.: x^4/((1-2*x) * (x^2+x-1) * (x^2-x-1)). [From R. J. Mathar, Feb 19 2010]
EXAMPLE
For n=15, k=10 mod 5 gives k=0, 5, 10, or 15, and C(15,0)+C(15,5)+C(15,10)+C(15,15) = 1+3003+3003+1, so a(15)=6008
MATHEMATICA
LinearRecurrence[{2, 3, -6, -1, 2}, {0, 0, 0, 0, 1}, 40] (* Harvey P. Dale, May 05 2018 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Henry Bottomley, Feb 10 2010
STATUS
approved