|
%I #10 Aug 21 2022 14:10:10
%S 1,1,0,1,0,1,1,0,1,2,1,1,0,1,3,3,3,3,1,0,1,4,4,2,6,12,2,4,6,1,0,1,5,5,
%T 5,10,20,10,10,10,30,10,5,10,1,0,1,6,6,6,3,15,30,30,15,15,20,60,30,60,
%U 5,15,60,30,6,15,1
%N Partition triangle read by rows, counting reducible permutations with weakly decreasing Lehmer code, refining triangle A356115.
%H Peter Luschny, <a href="https://github.com/PeterLuschny/PermutationsWithLehmer/blob/main/PermutationsWithLehmer.ipynb">Permutations with Lehmer</a>, a SageMath Jupyter Notebook.
%e [0] 1;
%e [1] 1;
%e [2] 0, 1;
%e [3] 0, 1, 1;
%e [4] 0, [1, 2], 1, 1;
%e [5] 0, [1, 3], [3, 3], 3, 1;
%e [6] 0, [1, 4, 4], [2, 6, 12], [2, 4], 6, 1;
%e [7] 0, [1, 5, 5], [5, 10, 20, 10], [10, 10, 30], [10, 5], 10, 1;
%e [8] 0, [1, 6, 6, 6],[3,15, 30, 30, 15],[15, 20, 60, 30, 60],[5,15,60],[30,6],15,1;
%e Summing the bracketed terms reduces the triangle to A356115.
%o (SageMath) # uses functions perm_red_stats and reducible from A356264.
%o @cache
%o def A356266_row(n: int) -> list[int]:
%o if n < 2: return [1]
%o return [0] + [v[1] for v in perm_red_stats(n, reducible, weakly_decreasing)]
%o def A356266(n: int, k: int) -> int:
%o return A356266_row(n)[k]
%o for n in range(8):
%o print(A356266_row(n))
%Y Cf. A356264, A356115 (reduced), A120588 (row sums).
%K nonn,tabf
%O 0,10
%A _Peter Luschny_, Aug 16 2022
|
