Triangle read by rows where T(n,k) is the number of chains of length k from minimum to maximum in the poset of integer partitions of n ordered by refinement.
A330785
Triangle read by rows where T(n,k) is the number of chains of length k from minimum to maximum in the poset of integer partitions of n ordered by refinement.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =3a(9) =2a(10) =0a(11) =1a(12) =5a(13) =8a(14) =4a(15) =0a(16) =1a(17) =9a(18) =25a(19) =28a(20) =11a(21) =0a(22) =1a(23) =13a(24) =57a(25) =111a(26) =99a(27) =33a(28) =0a(29) =1
External references
- oeis: A330785