Number T(n,k) of partitions of n into parts of exactly k sorts which are introduced in ascending order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A256130
Number T(n,k) of partitions of n into parts of exactly k sorts which are introduced in ascending order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =1a(6) =0a(7) =3a(8) =4a(9) =1a(10) =0a(11) =5a(12) =12a(13) =7a(14) =1a(15) =0a(16) =7a(17) =30a(18) =33a(19) =11a(20) =1a(21) =0a(22) =11a(23) =72a(24) =130a(25) =77a(26) =16a(27) =1a(28) =0a(29) =15
External references
- oeis: A256130