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

A156952
Triangle T(n, k, q) = t(n,q)/(t(k,q)*t(n-k,q)), where t(n, k) = Product_{j=1..n} q-Pochhammer(j, k+1, k+1)/(1-(k+1))^j and t(n, 0) = n!, with q = 3, read by rows.
4
1, 1, 1, 1, 5, 1, 1, 105, 105, 1, 1, 8925, 187425, 8925, 1, 1, 3043425, 5432513625, 5432513625, 3043425, 1, 1, 4154275125, 2528644954460625, 214934821129153125, 2528644954460625, 4154275125, 1
OFFSET
0,5
REFERENCES
Steve Roman, The Umbral Calculus, Dover Publications, New York (1984), page 182.
FORMULA
T(n, k, q) = t(n,q)/(t(k,q)*t(n-k,q)), where t(n, k) = Product_{j=1..n} q-Pochhammer(j, k+1, k+1)/(1-(k+1))^j and t(n, 0) = n!, with q = 3.
EXAMPLE
Triangle begins as:
1;
1, 1;
1, 5, 1;
1, 105, 105, 1;
1, 8925, 187425, 8925, 1;
1, 3043425, 5432513625, 5432513625, 3043425, 1;
MATHEMATICA
t[n_, k_]= If[k==0, n!, Product[QPochhammer[k+1, k+1, j]/(-k)^j, {j, n}]];
T[n_, k_, q_]= t[n, q]/(t[k, q]*t[n-k, q]);
Table[T[n, k, 3], {n, 0, 10}, {k, 0, n}]//Flatten (* modified by G. C. Greubel, Jan 08 2022 *)
PROG
(Sage)
from sage.combinat.q_analogues import q_pochhammer
def t(n, k): return factorial(n) if (k==0) else product( q_pochhammer(j, k+1, k+1)/(-k)^j for j in (1..n) )
def T(n, k, q): return t(n, q)/(t(k, q)*t(n-k, q))
flatten([[T(n, k, 3) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Jan 08 2022
CROSSREFS
Cf. A007318 (q=0), A156950 (q=1), A156951 (q=2), this sequence (q=3).
Cf. A156953.
Sequence in context: A106238 A173475 A174919 * A158748 A351241 A273874
KEYWORD
nonn,tabl
AUTHOR
Roger L. Bagula, Feb 19 2009
EXTENSIONS
Edited by G. C. Greubel, Jan 08 2022
STATUS
approved