|
%I #6 Oct 25 2015 10:53:58
%S 1,1,1,2,0,2,0,1,1,3,0,5,0,2,0,4,0,0,0,4,0,1,0,0,0,3,0,0,0,0,0,1,1,4,
%T 0,9,0,3,0,12,0,0,0,10,0,2,0,8,0,6,0,0,0,0,0,14,0,0,0,4,0,0,0,0,0,0,0,
%U 14,0,0,0,0,0,2,0,0,0,2,0,4,0,0,0,0,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0
%N Triangle read by rows: T(n,k) (n>=2, 1<=k<=n!) is the number of permutations of n whose inversion arrangement contains k regions.
%C Row sums give A000142, n >= 2.
%H FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000040">The number of regions of inversion arrangement of a permutation</a>.
%e Triangle begins:
%e 1,1,
%e 1,2,0,2,0,1,
%e 1,3,0,5,0,2,0,4,0,0,0,4,0,1,0,0,0,3,0,0,0,0,0,1,
%e ...
%Y Cf. A000142.
%K nonn,tabf
%O 2,4
%A _Christian Stump_, Oct 19 2015
|
