cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A329066 #54 Apr 02 2021 02:46:35
%S A329066 1,4,1,36,12,1,400,588,20,1,4900,49440,2100,28,1,63504,5187980,423440,
%T A329066 4956,36,1,853776,597027312,117234740,1751680,9540,44,1,11778624,
%U A329066 71962945824,36938855520,907687900,5101200,16236,52,1
%N 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).
%C A329066 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).
%C A329066 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).
%H A329066 Seiichi Manyama, <a href="/A329066/b329066.txt">Antidiagonals n = 0..50, flattened</a>
%H A329066 Wikipedia, <a href="https://en.wikipedia.org/wiki/Taxicab_geometry">Taxicab geometry</a>.
%F A329066 See the second code written in PARI.
%e A329066 Square array begins:
%e A329066    1,  4,   36,     400,       4900, ...
%e A329066    1, 12,  588,   49440,    5187980, ...
%e A329066    1, 20, 2100,  423440,  117234740, ...
%e A329066    1, 28, 4956, 1751680,  907687900, ...
%e A329066    1, 36, 9540, 5101200, 4190017860, ...
%o A329066 (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)}
%o A329066 (PARI) f(n) = (x^(2*n+2)-1/x^(2*n+2))/(x-1/x);
%o A329066 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)
%Y A329066 Columns k=0-1 give A000012, A017113.
%Y A329066 Rows n=0-2 give A002894, A329024, A329067.
%Y A329066 Main diagonal gives A342964.
%Y A329066 Cf. A005408, A328718, A329074, A329078.
%K A329066 nonn,tabl,walk
%O A329066 0,2
%A A329066 _Seiichi Manyama_, Nov 03 2019