Number of permutations p of [n] such that for each distance d in [n-1] there is at least one index i in [n-d] with p(i)>p(i+d).
A370514
Number of permutations p of [n] such that for each distance d in [n-1] there is at least one index i in [n-d] with p(i)>p(i+d).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =11a(5) =55a(6) =319a(7) =2233a(8) =17641a(9) =158769a(10) =1578667a(11) =17365337a(12) =207865289a(13) =2702248757a(14) =37786779669a(15) =566801695035
External references
- oeis: A370514