OFFSET
1,1
COMMENTS
Number of words of length n using a 12-symbol alphabet where neighboring letters are neighbors in the alphabet. - Andrew Howroyd, Apr 17 2017
LINKS
Joseph Myers, BMO 2008--2009 Round 1 Problem 1---Generalisation
Index entries for linear recurrences with constant coefficients, signature (1,5,-4,-6,3,1).
FORMULA
G.f.: -2*x*(3*x^5 + 12*x^4 - 12*x^3 - 20*x^2 + 5*x + 6)/(x^6 + 3*x^5 - 6*x^4 - 4*x^3 + 5*x^2 + x - 1). - Colin Barker, Sep 02 2012
MATHEMATICA
b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i == 0, Sum[b[n - 1, j, k], {j, 1, k}], If[i > 1, b[n - 1, i - 1, k], 0] + If[i < k, b[n - 1, i + 1, k], 0]]]; a[n_] := b[n, 0, 12]; Array[a, 30] (* Jean-François Alcover, Oct 10 2017, after Alois P. Heinz *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Joseph Myers, Dec 24 2008
STATUS
approved