Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= 1+log_2(floor(n))) giving number of non-squashing partitions of n into k parts.

A089177

Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= 1+log_2(floor(n))) giving number of non-squashing partitions of n into k parts.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =3a(8) =2a(9) =1a(10) =4a(11) =4a(12) =1a(13) =1a(14) =5a(15) =6a(16) =2a(17) =1a(18) =6a(19) =9a(20) =4a(21) =1a(22) =7a(23) =12a(24) =6a(25) =1a(26) =8a(27) =16a(28) =10a(29) =1

External references