TITLE: Looking for a good terminology for permutations having no substring
QUESTION [10 upvotes]: What is the good name for permutations of [1,...,n+1] having no substring [k,k+1]
http://oeis.org/A000255 ?

REPLY [10 votes]: These permutations are called "plus irreducible". 
See http://arxiv.org/pdf/math/0212163v1.pdf