OFFSET
0,3
COMMENTS
Number of walks of length n starting at vertex 0 in the following graph:
2
/|\
0-1 | 3
\|/
4.
Also, for n>=1, the number of walks of length n-1 starting at vertex 1 in the same graph.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Sean A. Irvine, Walks on Graphs.
Index entries for linear recurrences with constant coefficients, signature (1,5,-1,-2).
EXAMPLE
a(3)=7 because we have the walks 0-1-0-1, 0-1-2-1, 0-1-2-3, 0-1-2-4, 0-1-4-1, 0-1-4-2, 0-1-4-3.
MAPLE
a:= n-> (<<0|1|0|0|0>, <1|0|1|0|1>, <0|1|0|1|1>, <0|0|1|0|1>, <0|1|1|1|0>>^n. <<1, 1, 1, 1, 1>>)[1, 1]:
seq(a(n), n=0..32);
MATHEMATICA
CoefficientList[Series[(1-3*x^2) / (1-x-5*x^2+x^3+2*x^4), {x, 0, 32}], x]
LinearRecurrence[{1, 5, -1, -2}, {1, 1, 3, 7}, 33] (* Vincenzo Librandi, Oct 13 2025 *)
PROG
(Magma) I:=[1, 1, 3, 7]; [n le 4 select I[n] else Self(n-1) + 5*Self(n-2)-Self(n-3)-2*Self(n-4): n in [1..35]]; // Vincenzo Librandi, Oct 13 2025
CROSSREFS
KEYWORD
nonn,easy,walk
AUTHOR
Sean A. Irvine, Jun 05 2025
STATUS
approved
