login
A383566
Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) is the number of lattice paths from (0,0) to (n,k) using steps (1,0),(0,1),(4,4).
1
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 5, 10, 10, 5, 1, 1, 6, 15, 20, 15, 6, 1, 1, 7, 21, 35, 35, 21, 7, 1, 1, 8, 28, 56, 71, 56, 28, 8, 1, 1, 9, 36, 84, 128, 128, 84, 36, 9, 1, 1, 10, 45, 120, 213, 258, 213, 120, 45, 10, 1, 1, 11, 55, 165, 334, 474, 474, 334, 165, 55, 11, 1
OFFSET
0,5
FORMULA
A(n,k) = A(k,n).
A(n,k) = A(n-1,k) + A(n,k-1) + A(n-4,k-4).
G.f.: 1 / (1 - x - y - x^4*y^4).
EXAMPLE
Square array A(n,k) begins:
1, 1, 1, 1, 1, 1, 1, ...
1, 2, 3, 4, 5, 6, 7, ...
1, 3, 6, 10, 15, 21, 28, ...
1, 4, 10, 20, 35, 56, 84, ...
1, 5, 15, 35, 71, 128, 213, ...
1, 6, 21, 56, 128, 258, 474, ...
1, 7, 28, 84, 213, 474, 954, ...
PROG
(PARI) a(n, k) = my(x='x+O('x^(n+1)), y='y+O('y^(k+1))); polcoef(polcoef(1/(1-x-y-x^4*y^4), n), k);
CROSSREFS
Main diagonal gives A376792.
Sequence in context: A007318 A108086 A130595 * A108363 A383551 A329052
KEYWORD
nonn,tabl
AUTHOR
Seiichi Manyama, Apr 30 2025
STATUS
approved