Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have a decrease at index k (1<=k<n).

A056862

Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have a decrease at index k (1<=k<n).

Terms

    a(0) =0a(1) =0a(2) =1a(3) =0a(4) =3a(5) =4a(6) =0a(7) =10a(8) =14a(9) =16a(10) =0a(11) =37a(12) =54a(13) =63a(14) =68a(15) =0a(16) =151a(17) =228a(18) =271a(19) =296a(20) =311a(21) =0a(22) =674a(23) =1046a(24) =1264a(25) =1396a(26) =1478a(27) =1530a(28) =0a(29) =3263

External references