OFFSET
0,2
COMMENTS
By convention, the empty walk (corresponding to n=0) is considered to be a positive meander.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..200
C. Banderier, C. Krattenthaler, A. Krinik, D. Kruchinin, V. Kruchinin, D. Nguyen, and M. Wallner, Explicit formulas for enumeration of lattice paths: basketball and the kernel method, arXiv:1609.06473 [math.CO], 2016.
MATHEMATICA
frac[ex_] := Select[ex, Exponent[#, x] < 0&];
seq[n_] := Module[{v, m, p}, v = Table[0, n]; m = Sum[x^i, {i, -2, 2}] - 1; p = 1/x; v[[1]] = 1; For[i = 2, i <= n, i++, p = p*m // Expand; p = p - frac[p]; v[[i]] = p /. x -> 1]; v];
seq[27] (* Jean-François Alcover, Jul 01 2018, after Andrew Howroyd *)
PROG
(PARI) seq(n)={my(v=vector(n), m=sum(i=-2, 2, x^i)-1, p=1/x); v[1]=1; for(i=2, n, p*=m; p-=frac(p); v[i]=subst(p, x, 1)); v} \\ Andrew Howroyd, Jun 27 2018
CROSSREFS
KEYWORD
nonn,walk
AUTHOR
David Nguyen, Nov 20 2016
STATUS
approved