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