OFFSET
0,2
COMMENTS
Number of walks of length n starting at vertex 0 in the following graph:
1---2
/|\ |
0 | \ |
\| \|
4---3.
Also, by symmetry, the number of walks of length n starting at vertex 4 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,2).
EXAMPLE
a(2)=9 because we have the walks 3-1-0, 3-1-2, 3-1-3, 3-1-4, 3-2-1, 3-2-3, 3-4-0, 3-4-1, 3-4-3.
MAPLE
a:= n-> (<<0|1|0|0|1>, <1|0|1|1|1>, <0|1|0|1|0>, <0|1|1|0|1>, <1|1|0|1|0>>^n. <<1, 1, 1, 1, 1>>)[4, 1]:
seq(a(n), n=0..32);
MATHEMATICA
CoefficientList[Series[(1+2*x+x^2) / (1-x-5*x^2-2*x^3), {x, 0, 32}], x]
LinearRecurrence[{1, 5, 2}, {1, 3, 9}, 33] (* Vincenzo Librandi, Oct 14 2025 *)
PROG
(Magma) I:=[1, 3, 9]; [n le 3 select I[n] else Self(n-1) + 5*Self(n-2)+2*Self(n-3): n in [1..35]]; // Vincenzo Librandi, Oct 14 2025
CROSSREFS
KEYWORD
nonn,easy,walk
AUTHOR
Sean A. Irvine, Jun 05 2025
STATUS
approved
