OFFSET
0,2
COMMENTS
Number of walks of length n starting at vertex 0 in the following graph:
2
/|\
0-1-+-3
\|/
4.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..1000
Sean A. Irvine, Walks on Graphs.
Index entries for linear recurrences with constant coefficients, signature (2,4,-2).
EXAMPLE
a(2)=10 because we have the walks 2-1-0, 2-1-2, 2-1-3, 2-1-4, 2-3-1, 2-3-2, 2-3-4, 2-4-1, 2-4-2, 2-4-3.
MAPLE
a:= n-> (<<0|1|0|0|0>, <1|0|1|1|1>, <0|1|0|1|1>, <0|1|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+x) / (1-2*x-4*x^2+2*x^3), {x, 0, 32}], x]
LinearRecurrence[{2, 4, -2}, {1, 3, 10}, 30] (* Harvey P. Dale, Jul 07 2025 *)
CROSSREFS
KEYWORD
nonn,easy,walk
AUTHOR
Sean A. Irvine, Jun 05 2025
STATUS
approved
