OFFSET
0,5
COMMENTS
With rows reversed, T(n,k) appears to be the number of partitions of n with k big parts, where a big part is a part >= 2 (0 <= k <= n/2). For example, with n=4, the 3 partitions 4, 31, 211 each have one big part. - David Callan, Aug 23 2011
LINKS
D. J. Broadhurst and D. Kreimer, Towards cohomology of renormalization: bigrading the combinatorial Hopf algebra of rooted trees, arXiv:hep-th/0001202, 2000.
EXAMPLE
Triangle begins
1;
1, 1;
0, 2, 1;
0, 1, 3, 1;
0, 0, 2, 4, 1;
0, 0, 1, 4, 5, 1;
...
MATHEMATICA
t[n_, k_] := Count[ IntegerPartitions[n], pp_ /; Count[pp, p_ /; p >= 2] == k]; Flatten[ Table[ t[n, k], {n, 1, 14}, {k, n-1, 0, -1} ] ] (* Jean-François Alcover, Jan 23 2012, after David Callan *)
CROSSREFS
KEYWORD
AUTHOR
David Broadhurst, Feb 05 2000
STATUS
approved