Triangle read by rows: T(n,k) = number of collections of up to k+1 disjoint subsets of [n] covering [n], with [0]={}, 0<=k<=n.

A381682

Triangle read by rows: T(n,k) = number of collections of up to k+1 disjoint subsets of [n] covering [n], with [0]={}, 0<=k<=n.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =3a(5) =4a(6) =1a(7) =5a(8) =9a(9) =10a(10) =1a(11) =9a(12) =22a(13) =29a(14) =30a(15) =1a(16) =17a(17) =57a(18) =92a(19) =103a(20) =104a(21) =1a(22) =33a(23) =154a(24) =309a(25) =389a(26) =405a(27) =406a(28) =1a(29) =65

External references