%I #15 Feb 07 2017 06:40:36

%S 1,1,0,1,1,0,1,1,0,1,3,0,1,2,1,0,1,3,2,0,1,5,2,0,1,4,5,0,1,4,6,1,0,1,

%T 6,8,1,0,1,7,9,3,0,1,6,13,4,0,1,7,15,7,0,1,7,18,10,0,1,8,20,14,1,0,1,

%U 11,23,17,2,0,1,8,28,24,3,0,1,9,31,30,5,0,1

%N Number T(n,k) of partitions of n into distinct parts with boundary size k (where one part of size 0 is allowed).

%C Boundary size of a partition (or set) is the number of parts (elements) having fewer than 2 neighbors.

%C T(n,k) is also the number of subsets of {0, 1, 2, ...} whose elements sum to n and that have k elements in its boundary.

%H Alois P. Heinz, <a href="/A224878/b224878.txt">Rows n = 0..600, flattened</a>

%e T(9,1) = 1: [9].

%e T(9,2) = 6: [0,9], [1,8], [2,7], [3,6], [4,5], [2,3,4].

%e T(9,3) = 8: [1,2,6], [1,3,5], [0,1,8], [0,2,7], [0,3,6], [0,4,5], [0,2,3,4], [0,1,2,6].

%e T(9,4) = 1: [0,1,3,5].

%e Triangle T(n,k) begins:

%e 1, 1; (namely, the empty set and the set {0})

%e 0, 1, 1;

%e 0, 1, 1;

%e 0, 1, 3;

%e 0, 1, 2, 1;

%e 0, 1, 3, 2;

%e 0, 1, 5, 2;

%e 0, 1, 4, 5;

%e 0, 1, 4, 6, 1;

%e 0, 1, 6, 8, 1;

%e 0, 1, 7, 9, 3;

%e 0, 1, 6, 13, 4;

%e 0, 1, 7, 15, 7;

%p b:= proc(n, i, t) option remember; `if`(n=0 and i<0, `if`(t>1, x, 1),

%p expand(`if`(i<0, 0, `if`(t>1, x, 1)*b(n, i-1, iquo(t, 2))+

%p `if`(i>n, 0, `if`(t=2, x, 1)*b(n-i, i-1, iquo(t, 2)+2)))))

%p end:

%p T:= n-> (p->seq(coeff(p, x, i), i=0..degree(p)))(b(n$2, 0)):

%p seq(T(n), n=0..30); # _Alois P. Heinz_, Jul 23 2013

%t b[n_, i_, t_] := b[n, i, t] = If[n==0 && i<0, If[t>1, x, 1], Expand[If[i<0, 0, If[t>1, x, 1]*b[n, i-1, Quotient[t, 2]] + If[i>n, 0, If[t==2, x, 1] * b[n-i, i-1, Quotient[t, 2]+2]]]]]; T[n_] := Function[p, Table[ Coefficient[ p, x, i], {i, 0, Exponent[p, x]}]][b[n, n, 0]]; Table[T[n], {n, 0, 30}] // Flatten (* _Jean-François Alcover_, Feb 07 2017, after _Alois P. Heinz_ *)

%Y Cf. A227551 (no parts of size 0 are allowed).

%Y Row sums are twice A000009.

%K nonn,tabf

%O 0,11

%A _Patrick Devlin_, Jul 23 2013