OFFSET
0,5
COMMENTS
Column k is the k-fold self-convolution of sigma (A000203). - Alois P. Heinz, Feb 01 2021
For fixed k, Sum_{j=1..n} T(j,k) ~ Pi^(2*k) * n^(2*k) / (6^k * (2*k)!). - Vaclav Kotesovec, Sep 20 2024
LINKS
Alois P. Heinz, Rows n = 0..200, flattened
FORMULA
The polynomials are defined by recurrence: p(0,x) = 1 and for n > 0 by
p(n, x) = x*Sum_{k=0..n-1} sigma(n-k)*p(k, x).
EXAMPLE
Triangle starts:
[0] 1;
[1] 0, 1;
[2] 0, 3, 1;
[3] 0, 4, 6, 1;
[4] 0, 7, 17, 9, 1;
[5] 0, 6, 38, 39, 12, 1;
[6] 0, 12, 70, 120, 70, 15, 1;
[7] 0, 8, 116, 300, 280, 110, 18, 1;
[8] 0, 15, 185, 645, 885, 545, 159, 21, 1;
[9] 0, 13, 258, 1261, 2364, 2095, 942, 217, 24, 1;
MAPLE
P := proc(n, x) option remember; if n = 0 then 1 else
x*add(numtheory:-sigma(n-k)*P(k, x), k=0..n-1) fi end:
Trow := n -> seq(coeff(P(n, x), x, k), k=0..n):
seq(Trow(n), n=0..9);
# second Maple program:
T:= proc(n, k) option remember; `if`(k=0, `if`(n=0, 1, 0),
`if`(k=1, `if`(n=0, 0, numtheory[sigma](n)), (q->
add(T(j, q)*T(n-j, k-q), j=0..n))(iquo(k, 2))))
end:
seq(seq(T(n, k), k=0..n), n=0..10); # Alois P. Heinz, Feb 01 2021
# Uses function PMatrix from A357368.
PMatrix(10, NumberTheory:-sigma); # Peter Luschny, Oct 19 2022
MATHEMATICA
T[n_, k_] := T[n, k] = If[k == 0, If[n == 0, 1, 0],
If[k == 1, If[n == 0, 0, DivisorSigma[1, n]],
With[{q = Quotient[k, 2]}, Sum[T[j, q]*T[n-j, k-q], {j, 0, n}]]]];
Table[Table[T[n, k], {k, 0, n}], {n, 0, 10}] // Flatten (* Jean-François Alcover, Feb 11 2021, after Alois P. Heinz *)
KEYWORD
nonn,tabl
AUTHOR
Peter Luschny, Oct 03 2018
STATUS
approved