Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of partitions of n with exactly k kinds of 1's which are introduced in ascending order.
A292746
Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of partitions of n with exactly k kinds of 1's which are introduced in ascending order.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =2a(8) =3a(9) =1a(10) =2a(11) =3a(12) =8a(13) =6a(14) =1a(15) =2a(16) =5a(17) =19a(18) =26a(19) =10a(20) =1a(21) =4a(22) =7a(23) =43a(24) =97a(25) =66a(26) =15a(27) =1a(28) =4a(29) =11
External references
- oeis: A292746