Number T(n,k) of permutations p of [n] such that n-k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i<p(i)]]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A324564
Number T(n,k) of permutations p of [n] such that n-k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i<p(i)]]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =4a(7) =1a(8) =1a(9) =0a(10) =15a(11) =7a(12) =1a(13) =1a(14) =0a(15) =76a(16) =31a(17) =11a(18) =1a(19) =1a(20) =0a(21) =455a(22) =185a(23) =60a(24) =18a(25) =1a(26) =1a(27) =0a(28) =3186a(29) =1275
External references
- oeis: A324564