OFFSET
1,2
COMMENTS
T(n,k) is the minimum value of Product_{i=1..n} Sum_{j=1..k} r[(i-1)*k+j] among all permutations r of {1..kn}. For the maximum value see A333420.
LINKS
Chai Wah Wu, On rearrangement inequalities for multiple sequences, arXiv:2002.10514 [math.CO], 2020.
FORMULA
T(n,k) = k^(2n)*Gamma(n+(1+k)/2k)/Gamma((1+k)/2k).
PROG
(Python)
def T(n, k): # T(n, k) for A333445
c, l = 1, list(range(1, k*n+1, k))
lt = list(l)
for i in range(n):
for j in range(1, k):
lt[i] += l[i]+j
c *= lt[i]
return c
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Chai Wah Wu, Mar 23 2020
STATUS
approved