OFFSET
0,3
LINKS
FORMULA
Conjecture: B(n, k, m) = (Sum_{j_1=0..n} Sum_{j_2=0..j_1} ... Sum_{j_m=0..j_{m-1}} (-1)^(j_1 + j_2 + ... + j_m) * (Product_{1 <= q < p <= m} (j_q - j_p + p - q)^2) * Product_{t=1..m} (n+t-1)_{j_t} * (n-j_t+t)^(n+k) / (j_t+m-t)!) / (Product_{i=0..m-1} (n+i)!) where B(n, k, m) is the determinant of the k X k matrix with (i, j)-th entry |Stirling1(n+m+i, n+j)|, where (x)_{n} is the falling factorial defined as (x)_{n} = Product_{k=0..n-1} (x-k).
EXAMPLE
Array starts:
[0] 1, 2, 4, 8, 16, 32, 64, ... [A000079]
[1] 1, 11, 85, 575, 3661, 22631, 137845, ... [A001240]
[2] 1, 35, 725, 11935, 173901, 2360295, 30673525, ...
[3] 1, 85, 3850, 129360, 3665151, 93355395, 2216707900, ...
[4] 1, 175, 15190, 929334, 46149327, 2000578965, 79000290160, ...
[5] 1, 322, 48804, 5012406, 405247689, 27912905328, 1717078544896, ...
MAPLE
det := LinearAlgebra:-Determinant: StirlingCycle := abs@Stirling1:
m := (n, i, j) -> StirlingCycle(n + i + 2, n + j):
M := (n, k) -> Matrix(k, k, (i, j) -> m(n, i, j)): A := (n, k) -> det(M(n, k)):
seq(seq(A(n - k, k), k = 0..n), n = 0..9); # Peter Luschny, May 31 2026
PROG
(PARI) A(n, k) = matdet(matrix(k, k, i, j, abs(stirling(n+i+2, n+j, 1))))
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Mikhail Kurkov, May 29 2026
STATUS
approved
