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”).

A329066
Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) is the constant term in the expansion of ( (Sum_{j=0..n} x^(2*j+1)+1/x^(2*j+1)) * (Sum_{j=0..n} y^(2*j+1)+1/y^(2*j+1)) - (Sum_{j=0..n-1} x^(2*j+1)+1/x^(2*j+1)) * (Sum_{j=0..n-1} y^(2*j+1)+1/y^(2*j+1)) )^(2*k).
6
1, 4, 1, 36, 12, 1, 400, 588, 20, 1, 4900, 49440, 2100, 28, 1, 63504, 5187980, 423440, 4956, 36, 1, 853776, 597027312, 117234740, 1751680, 9540, 44, 1, 11778624, 71962945824, 36938855520, 907687900, 5101200, 16236, 52, 1
OFFSET
0,2
COMMENTS
T(n,k) is the number of (2*k)-step closed paths (from origin to origin) in 2-dimensional lattice, using steps (t_1,t_2) (|t_1| + |t_2| = 2*n+1).
T(n,k) is the constant term in the expansion of (Sum_{j=0..2*n+1} (x^j + 1/x^j)*(y^(2*n+1-j) + 1/y^(2*n+1-j)) - x^(2*n+1) - 1/x^(2*n+1) - y^(2*n+1) - 1/y^(2*n+1))^(2*k).
LINKS
FORMULA
See the second code written in PARI.
EXAMPLE
Square array begins:
1, 4, 36, 400, 4900, ...
1, 12, 588, 49440, 5187980, ...
1, 20, 2100, 423440, 117234740, ...
1, 28, 4956, 1751680, 907687900, ...
1, 36, 9540, 5101200, 4190017860, ...
PROG
(PARI) {T(n, k) = polcoef(polcoef((sum(j=0, 2*n+1, (x^j+1/x^j)*(y^(2*n+1-j)+1/y^(2*n+1-j)))-x^(2*n+1)-1/x^(2*n+1)-y^(2*n+1)-1/y^(2*n+1))^(2*k), 0), 0)}
(PARI) f(n) = (x^(2*n+2)-1/x^(2*n+2))/(x-1/x);
T(n, k) = sum(j=0, 2*k, (-1)^j*binomial(2*k, j)*polcoef(f(n)^j*f(n-1)^(2*k-j), 0)^2)
CROSSREFS
Columns k=0-1 give A000012, A017113.
Rows n=0-2 give A002894, A329024, A329067.
Main diagonal gives A342964.
Sequence in context: A091741 A061036 A217020 * A144267 A011801 A169656
KEYWORD
nonn,tabl,walk
AUTHOR
Seiichi Manyama, Nov 03 2019
STATUS
approved