cp's OEIS Frontend

A364513 Square array read by ascending antidiagonals: T(n,k) = [x^k] (1 - x)^(2*k) * Legendre_P(n*k-1, (1 + x)/(1 - x)) for n, k >= 0.

%I A364513 #13 Aug 06 2023 16:47:30
%S A364513 1,1,-2,1,-2,6,1,0,0,-20,1,4,0,16,70,1,10,126,0,0,-252,1,18,594,4900,
%T A364513 0,-252,924,1,28,1716,44200,209950,0,0,-3432,1,40,3900,205920,3640210,
%U A364513 9513504,0,4800,12870,1,54,7650,685216,27386100,317678760,447103440,0,0,-48620,1,70,13566,1847560,133501500,3861534768,28782923400,21558808128,0,-100100,184756
%N A364513 Square array read by ascending antidiagonals: T(n,k) = [x^k] (1 - x)^(2*k) * Legendre_P(n*k-1, (1 + x)/(1 - x)) for n, k >= 0.
%C A364513 Compare with A364303.
%C A364513 Given two sequences of integers c = (c_1, c_2, ..., c_K) and d = (d_1, d_2, ..., d_L), where c_1 + ... + c_K = d_1 + ... + d_L, we can define the factorial ratio sequence u_n(c, d) = (c_1*n)!*(c_2*n)!* ... *(c_K*n)!/ ( (d_1*n)!*(d_2*n)!* ... *(d_L*n)! ) and ask whether it is integral for all n >= 0. The integer L - K is called the height of the sequence. Bober completed the classification of integral factorial ratio sequences of height 1 (see A295431). Soundararajan gives many examples of two-parameter families of integral factorial ratio sequences of height 2.
%C A364513 Each row of the present table is an integral factorial ratio sequence of height 2. It is usually assumed that the c's and d's are integers but here some of the c's and d's are half-integers. See A276098 and the cross references there for further examples of this type.
%H A364513 J. W. Bober, <a href="https://arxiv.org/abs/0709.1977">Factorial ratios, hypergeometric series, and a family of step functions</a>, arXiv:0709.1977 [math.NT], 2007; J. London Math. Soc. (2) 79 2009, 422-444.
%H A364513 K. Soundararajan, <a href="http://doi.org/10.1098/rsta.2018.0444">Integral factorial ratios: irreducible examples with height larger than 1</a>, Phil. Trans. Royal Soc., A378: 2018044, 2019.
%H A364513 Wikipedia, <a href="https://en.wikipedia.org/wiki/Dixon%27s_identity">Dixon's identity</a>
%F A364513 T(n,k) = Sum_{i = 0..k} binomial(n*k-1, k-i)^2 * binomial((n-2)*k+i-2, i).
%F A364513 T(n,1) = 1 for all n and for n >= 2 and k >= 1, T(n,k) = binomial((k*n-1), k)^2 * hypergeom([a, b, b], [1 + a - b, 1 + a - b], 1), where a = (n - 2)*k - 1 and b = -k.
%F A364513 For n >= 3 and k >= 1, T(n,k) = ((n*k - 1))! * ( ((n+2)*k - 1)/2 )! *  ( ((n-2)*k - 1)/2 )! / ( k!^2 *  ((n-2)*k - 1)! * ((n*k - 1)/2)!^2 ) by Dixon's 3F2 summation theorem, where fractional factorials are defined in terms of the gamma function.
%F A364513 For n >= 3 and k >= 1, T(n,k) = (n-2)/n * ((n+2)*k)!*(n*k/2)!^2 / ( ((n+2)*k/2)! * (n*k)! * ((n-2)*k/2)! * k!^2 ).
%F A364513 The central binomial numbers A000984, row 1 unsigned, satisfy the supercongruences A000984(n*p^r) == A000984(n*p^(r-1)) (mod p^(3*r)) for all primes p >= 5 and all positive integers n and r. We conjecture that each row sequence of the table satisfies the same supercongruences.
%e A364513  Square array begins:
%e A364513  n\k|  0    1       2         3            4              5
%e A364513   - + - - - - - - - - - - - - - - - - - - - - - - - - - - -
%e A364513   0 |  1   -2       6       -20           70           -252   ... (see A000984)
%e A364513   1 |  1   -2       0        16            0           -252   ...  A364514
%e A364513   2 |  1    0       0         0            0              0
%e A364513   3 |  1    4     126      4900       209950        9513504   ...  (1/3)*A352651
%e A364513   4 |  1   10     594     44200      3640210      317678760   ...  A364515
%e A364513   5 |  1   18    1716    205920     27386100     3861534768   ...  (3/5)*A352652
%e A364513   6 |  1   28    3900    685216    133501500    27583083528   ...  A364516
%e A364513   7 |  1   40    7650   1847560    494944450   140625140040   ...  A364517
%p A364513 T(n,k) := coeff(series( (1 - x)^(2*k) * LegendreP(n*k-1, (1 + x)/(1 - x)), x, 11), x, k):
%p A364513 # display as a square array
%p A364513 seq(print(seq(T(n, k), k = 0..10)), n = 0..10);
%p A364513 # display as a sequence
%p A364513 seq(seq(T(n-k, k), k = 0..n), n = 0..10);
%Y A364513 Cf. A000984 (row 0 unsigned), A276098, A295431, A352651 (3*row 3), A352652 ((5/3)*row 5), A364303, A364506, A364509, A364514 (row 1), A364515 (row 4), A364516 (row 6), A364517 (row 7).
%K A364513 sign,tabl,easy
%O A364513 0,3
%A A364513 _Peter Bala_, Jul 31 2023