OFFSET
0,3
COMMENTS
In general, a(n) = (2/m)*Sum_{k=1..m} sin(Pi*k/m)^2(1+2*cos(Pi*k/m))^n counts the (s(0), s(1), ..., s(n)) such that 0 < s(i) < m and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 1. Here, m=7.
a(n) is the number of Motzkin n-paths of height <= 5. - Alois P. Heinz, Nov 24 2023
LINKS
S. Felsner, D. Heldt, Lattice Path Enumeration and Toeplitz Matrices, J. Int. Seq. 18 (2015) # 15.1.3.
Daniel Heldt, On the mixing time of the face flip-and up/down Markov chain for some families of graphs, Dissertation, Mathematik und Naturwissenschaften der Technischen Universität Berlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften, 2016.
FORMULA
a(n) = (2/7)*Sum_{k=1..6} sin(Pi*k/7)^2(1+2*cos(Pi*k/7))^n.
Conjecture: a(n)= +6*a(n-1) -10*a(n-2) +9*a(n-4) -2*a(n-5) -a(n-6) with g.f. -x*(-1+4*x-2*x^2-5*x^3+2*x^4+x^5) / ( (x^3+3*x^2-4*x+1)*(x^3-x^2-2*x+1) ). - R. J. Mathar, Dec 20 2011
MATHEMATICA
f[n_] := FullSimplify[ TrigToExp[(2/7)*Sum[ Sin[Pi*k/7]^2(1 + 2Cos[Pi*k/7])^n, {k, 1, 6}]]]; Table[ f[n], {n, 28}] (* Robert G. Wilson v, Jun 18 2004 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Herbert Kociemba, Jun 02 2004
EXTENSIONS
a(0)=1 prepended by Alois P. Heinz, Nov 24 2023
STATUS
approved