|
%I #16 Sep 10 2022 07:36:13
%S 0,0,1,0,1,1,2,0,0,0,1,1,1,1,1,1,2,2,3,0,0,0,3,0,3,0,0,0,0,0,0,0,0,0,
%T 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,3,3,4,0,
%U 0,0,4,0,4,0,0,0,0,0,0,0,0,0,3,3,4,0,0
%N a(n) is the first split point of the permutation p if p is the n-th permutation (in lexicographic order (A030298 prepended by the empty permutation)), or zero if it has no split point.
%C A permutation p in [n] (where n >= 0) is reducible if there exist an i in 1..n-1 such that for all j in the range 1..i and all k in the range i+1..n it is true that p(j) < p(k). (Note that a range a..b includes a and b.) If such an i exists we say that i splits the permutation p at i and that i is a split point of p.
%C The list of permutations starts with the empty permutation (), which has no split points. The first permutation which has a split point is (1, 2).
%C The number of terms corresponding to the permutations of [n] which vanish is A003319(n), and the numbers of nonzero terms is A356291(n).
%e Rows give the terms corresponding to the permutations of [n].
%e [0] [0]
%e [1] [0]
%e [2] [1, 0]
%e [3] [1, 1, 2, 0, 0, 0]
%e [4] [1, 1, 1, 1, 1, 1, 2, 2, 3, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0]
%o (SageMath)
%o def FirstSplit(p) -> int:
%o n = p.size()
%o for i in (1..n-1):
%o ok = True
%o for j in (1..i):
%o if not ok: break
%o for k in (i + 1..n):
%o if p(j) > p(k):
%o ok = False
%o break
%o if ok: return i
%o return 0
%o def A356324_row(n): return [FirstSplit(p) for p in Permutations(n)]
%o for n in range(6): print(A356324_row(n))
%Y Cf. A003319, A356291, A059438, A030298.
%K nonn,tabf
%O 0,7
%A _Peter Luschny_, Aug 03 2022
|
