|
|
A151496
|
|
Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1,-1), (-1,0), (-1,1), (0,-1), (0,1), (1,-1), (1,0), (1,1)}.
|
|
0
|
|
|
1, 1, 7, 27, 160, 870, 5345, 32865, 211512, 1380372, 9214548, 62327958, 427516056, 2963478804, 20745401391, 146427786219, 1041261685464, 7453015732448, 53661092431232, 388397497629284, 2824677704718896, 20632192727484936, 151301370605585252, 1113568687159297278, 8223216946375477960
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
G.f.: ((1-5*x)*Int((hypergeom([1/2,1/2],[1],16*x*(1+x)/ (1+4*x)^2)+8*x*hypergeom([1/2,1/2],[2],16*x*(1+x)/(1+4*x)^2))/((5*x-1)^2*(1+4*x)),x)-x)/(4*x^2). - Mark van Hoeij, Aug 20 2014
|
|
MATHEMATICA
|
aux[i_Integer, j_Integer, n_Integer] := Which[Min[i, j, n] < 0 || Max[i, j] > n, 0, n == 0, KroneckerDelta[i, j, n], True, aux[i, j, n] = aux[-1 + i, -1 + j, -1 + n] + aux[-1 + i, j, -1 + n] + aux[-1 + i, 1 + j, -1 + n] + aux[i, -1 + j, -1 + n] + aux[i, 1 + j, -1 + n] + aux[1 + i, -1 + j, -1 + n] + aux[1 + i, j, -1 + n] + aux[1 + i, 1 + j, -1 + n]]; Table[Sum[aux[0, k, n], {k, 0, n}], {n, 0, 25}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|