Triangle read by rows: T(n,k) = number of collections of up to k subsets of [n] covering [n], with [0]={}; n>=0, k=0..2^n.

A381683

Triangle read by rows: T(n,k) = number of collections of up to k subsets of [n] covering [n], with [0]={}; n>=0, k=0..2^n.

Terms

    a(0) =1a(1) =2a(2) =0a(3) =1a(4) =2a(5) =0a(6) =1a(7) =5a(8) =9a(9) =10a(10) =0a(11) =1a(12) =14a(13) =58a(14) =125a(15) =181a(16) =209a(17) =217a(18) =218a(19) =0a(20) =1a(21) =41a(22) =401a(23) =1947a(24) =6091a(25) =13987a(26) =25395a(27) =38261a(28) =49701a(29) =57709

External references