Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of non-squashing partitions of n into distinct parts of which the greatest is k.
A089198
Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of non-squashing partitions of n into distinct parts of which the greatest is k.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =1a(6) =0a(7) =0a(8) =1a(9) =1a(10) =0a(11) =0a(12) =0a(13) =1a(14) =1a(15) =0a(16) =0a(17) =0a(18) =1a(19) =1a(20) =1a(21) =0a(22) =0a(23) =0a(24) =1a(25) =1a(26) =1a(27) =1a(28) =0a(29) =0
External references
- oeis: A089198