login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A277920
Number of positive walks with n steps {-4,-3,-2,-1,0,1,2,3,4} starting at the origin, ending at altitude 1, and staying strictly above the x-axis.
1
0, 1, 4, 20, 120, 780, 5382, 38638, 285762, 2162033, 16655167, 130193037, 1030117023, 8234025705, 66391916397, 539360587341, 4410492096741, 36274113675369, 299864297741292, 2490192142719336, 20764402240048267, 173784940354460219, 1459360304511145146
OFFSET
0,3
LINKS
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.
MAPLE
b:= proc(n, y) option remember; `if`(n=0, `if`(y=1, 1, 0),
add((h-> `if`(h<1, 0, b(n-1, h)))(y+d), d=-4..4))
end:
a:= n-> b(n, 0):
seq(a(n), n=0..23); # Alois P. Heinz, Nov 12 2016
MATHEMATICA
b[n_, y_] := b[n, y] = If[n == 0, If[y == 1, 1, 0], Sum[Function[h, If[h < 1, 0, b[n - 1, h]]][y + d], {d, -4, 4}]];
a[n_] := b[n, 0];
Table[a[n], {n, 0, 23}] (* Jean-François Alcover, Apr 03 2017, after Alois P. Heinz *)
CROSSREFS
KEYWORD
nonn,walk
AUTHOR
David Nguyen, Nov 04 2016
STATUS
approved