Problems(1)
Let N be a given positive integer. Consider a permutation of 1,2,3,⋯,N, denoted as p1,p2,⋯,pN. For a section pl,pl+1,⋯,pr, we call it "extreme" if pl and pr are the maximum and minimum value of that section. We say a permutation p1,p2,⋯,pN is "super balanced" if there isn't an "extreme" section with a length at least 3. For example, 1,4,2,3 is "super balanced", but 3,1,2,4 isn't. Please answer the following questions:
1. How many "super balanced" permutations are there?
2. For each integer M≤N. How many "super balanced" permutations are there such that p1=M?Proposed by ltf0501 combinatoricsIMOC