login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156692 Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(i+1) ) and m = 3, read by rows. 8

%I #9 Feb 28 2021 03:16:27

%S 1,1,1,1,-7,1,1,77,77,1,1,-1155,12705,-1155,1,1,21945,3620925,3620925,

%T 21945,1,1,-504735,1582344225,-23735163375,1582344225,-504735,1,1,

%U 13627845,982635763725,280051192661625,280051192661625,982635763725,13627845,1

%N Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(i+1) ) and m = 3, read by rows.

%C Row sums are: {1, 2, -5, 156, 10397, 7285742, -20571484393, 562067684106392, 91653158600215578137, ...}.

%H G. C. Greubel, <a href="/A156692/b156692.txt">Rows n = 0..30 of the triangle, flattened</a>

%F T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(i+1) ) and m = 3.

%F T(n, k, m, p, q) = (-p*(m+1))^(k*(n-k)) * (f(n,m,p,q)/(f(k,m,p,q)*f(n-k,m,p,q))) where Product_{j=1..n} Pochhammer( (q*(m+1) -1)/(p*(m+1)), j) for (m, p, q) = (3, 1, 1). - _G. C. Greubel_, Feb 25 2021

%e Triangle begins as:

%e 1;

%e 1, 1;

%e 1, -7, 1;

%e 1, 77, 77, 1;

%e 1, -1155, 12705, -1155, 1;

%e 1, 21945, 3620925, 3620925, 21945, 1;

%e 1, -504735, 1582344225, -23735163375, 1582344225, -504735, 1;

%t (* First program *)

%t t[n_, k_]:= If[k==0, n!, Product[1 -(i+1)*(k+1), {j,n}, {i,0,j-1}] ];

%t T[n_, k_, m_]:= If[n==0, 1, t[n, m]/(t[k, m]*t[n-k, m])];

%t Table[T[n,k,3], {n,0,12}, {k,0,n}]//Flatten (* modified by _G. C. Greubel_, Feb 25 2021 *)

%t (* Second program *)

%t f[n_, m_, p_, q_]:= Product[Pochhammer[(q*(m+1) -1)/(p*(m+1)), j], {j,n}];

%t T[n_, k_, m_, p_, q_]:= (-p*(m+1))^(k*(n-k))*(f[n,m,p,q]/(f[k,m,p,q]*f[n-k,m,p,q]));

%t Table[T[n,k,3,1,1], {n,0,12}, {k,0,n}]//Flatten (* _G. C. Greubel_, Feb 25 2021 *)

%o (Sage)

%o @CachedFunction

%o def f(n, m, p, q): return product( rising_factorial( (q*(m+1)-1)/(p*(m+1)), j) for j in (1..n))

%o def T(n, k, m, p, q): return (-p*(m+1))^(k*(n-k))*(f(n,m,p,q)/(f(k,m,p,q)*f(n-k,m,p,q)))

%o flatten([[T(n,k,3,1,1) for k in (0..n)] for n in (0..12)]) # _G. C. Greubel_, Feb 25 2021

%o (Magma)

%o f:= func< n,m,p,q | n eq 0 select 1 else m eq 0 select Factorial(n) else (&*[ 1 -(p*i+q)*(m+1): i in [0..j], j in [0..n-1]]) >;

%o T:= func< n,k,m,p,q | f(n,m,p,q)/(f(k,m,p,q)*f(n-k,m,p,q)) >;

%o [T(n,k,3,1,1): k in [0..n], n in [0..12]]; // _G. C. Greubel_, Feb 25 2021

%Y Cf. A007318 (m=0), A156690 (m=1), A156691 (m=2), this sequence (m=3).

%Y Cf. A156693, A156698, A156727.

%K sign,tabl

%O 0,5

%A _Roger L. Bagula_, Feb 13 2009

%E Edited by _G. C. Greubel_, Feb 25 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)