T(n,k) is the number permutations p of [n] that are j-dist-increasing for exactly k distinct values j in [n], where p is j-dist-increasing if j>=0 and p(i)<p(i+j) for all i in [n-j]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A370506
T(n,k) is the number permutations p of [n] that are j-dist-increasing for exactly k distinct values j in [n], where p is j-dist-increasing if j>=0 and p(i)<p(i+j) for all i in [n-j]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =3a(8) =2a(9) =1a(10) =0a(11) =11a(12) =8a(13) =4a(14) =1a(15) =0a(16) =55a(17) =38a(18) =19a(19) =7a(20) =1a(21) =0a(22) =319a(23) =228a(24) =110a(25) =50a(26) =12a(27) =1a(28) =0a(29) =2233
External references
- oeis: A370506