A094288 Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 1.

1, 1, 2, 4, 9, 21, 51, 127, 323, 835, 2188, 5798, 15511, 41835, 113633, 310557, 853333, 2355861, 6531062, 18171848, 50722229, 141973073, 398351055, 1120056347, 3155043447, 8901325751, 25147423616, 71127785002, 201381834019, 570655858439, 1618256772285

Offset

0,3

Comments

In general, a(n) = (2/m)*Sum_{k=1..m-1} 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 is m=8.

a(n) is the number of Motzkin n-paths of height <= 6. - Alois P. Heinz, Nov 24 2023

Links

Alois P. Heinz, Table of n, a(n) for n = 0..2203

S. Felsner and 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) = (1/4)*Sum_{k=1..7} sin(Pi*k/8)^2*(1+2*cos(Pi*k/8))^n.

Conjecture: a(n)= +7*a(n-1) -15*a(n-2) +5*a(n-3) +15*a(n-4) -9*a(n-5) -3*a(n-6) +a(n-7) with g.f. -x*(1-5*x+5*x^2+6*x^3-7*x^4-2*x^5+x^6) / ( (x-1)*(x^2+2*x-1)*(x^4-4*x^3-2*x^2+4*x-1) ). - R. J. Mathar, Dec 20 2011

Mathematica

f[n_] := FullSimplify[ TrigToExp[(1/4)*Sum[Sin[Pi*k/8]^2(1 + 2Cos[Pi*k/8])^n, {k, 1, 7}]]]; Table[ f[n], {n, 28}] (* Robert G. Wilson v, Jun 18 2004 *)

Crossrefs

This is a different sequence from the Motzkin numbers, A001006.

Sequence in context: A257387 A094286 A094287 * A168051 A166587 A292440

Adjacent sequences: A094285 A094286 A094287 * A094289 A094290 A094291

Keyword

easy,nonn

Author

Herbert Kociemba, Jun 02 2004

Extensions

a(0)=1 prepended by Alois P. Heinz, Nov 24 2023

Status

approved