OFFSET
1,13
LINKS
FORMULA
Conjecture: Sum_{n>=1} T(n,k)/n = log(k).
From Mats Granvik, Apr 24 2022: (Start)
Sum recurrence:
T(n, 1) = [n >= 1]*0;
T(n, k) = [n < k]*1;
T(n, k) = [n >= k](Sum_{i=1..k-1} T(n - i, k - 1) - Sum_{i=1..k-1} T(n - i, k)).
Product recurrence:
T(n, 1) = [n >= 1]*0;
T(n, k) = [n < k]*1;
T(n, k) = [n >= k](Product_{i=1..k-1} T(n - i, k - 1) - Product_{i=1..k-1} T(n - i, k)).
(End)
EXAMPLE
Table begins:
0..1..1..1..1..1..1..1..1...
0.-1..1..1..1..1..1..1..1...
0..1.-2..1..1..1..1..1..1...
0.-1..1.-3..1..1..1..1..1...
0..1..1..1.-4..1..1..1..1...
0.-1.-2..1..1.-5..1..1..1...
0..1..1..1..1..1.-6..1..1...
0.-1..1.-3..1..1..1.-7..1...
0..1.-2..1..1..1..1..1.-8...
MATHEMATICA
nn = 30; t[n_, k_] := t[n, k] = If[Mod[n, k] == 0, -(k - 1), 1]; MatrixForm[Table[Table[t[n, k], {k, 1, nn}], {n, 1, nn}]]
CROSSREFS
KEYWORD
AUTHOR
Mats Granvik, Jun 19 2011
STATUS
approved