Number T(n,k) of blocks of size >= k in all set partitions of [n], assuming that every set partition contains one block of size zero; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

A283424

Number T(n,k) of blocks of size >= k in all set partitions of [n], assuming that every set partition contains one block of size zero; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Terms

    a(0) =1a(1) =2a(2) =1a(3) =5a(4) =3a(5) =1a(6) =15a(7) =10a(8) =4a(9) =1a(10) =52a(11) =37a(12) =17a(13) =5a(14) =1a(15) =203a(16) =151a(17) =76a(18) =26a(19) =6a(20) =1a(21) =877a(22) =674a(23) =362a(24) =137a(25) =37a(26) =7a(27) =1a(28) =4140a(29) =3263

External references