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

A056861

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

Terms

    a(0) =1a(1) =3a(2) =2a(3) =10a(4) =7a(5) =6a(6) =37a(7) =27a(8) =23a(9) =21a(10) =151a(11) =114a(12) =97a(13) =88a(14) =83a(15) =674a(16) =523a(17) =446a(18) =403a(19) =378a(20) =363a(21) =3263a(22) =2589a(23) =2217a(24) =1999a(25) =1867a(26) =1785a(27) =1733a(28) =17007a(29) =13744

External references