566801695035domain: NAppears in sequencesNumber 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).at n=15A370514