|
%I #11 Jan 09 2024 10:53:47
%S 0,0,0,0,1,5,15,35,70,140,252,420,660,990,1485,2145,3003,4095,5460,
%T 7280,9520,12240,15504,19381,24226,29926,36576,44276,53135,63761,
%U 75905,89705,105305,122865,143340,166272,191850,220270,251755,287715,327395,371043
%N Maximal number of 15432 patterns in a permutation of 1,2,...,n.
%D W. Stromquist, Packing layered posets into posets, manuscript.
%H M. Bona, B. Sagan, and V. Vatter, <a href="https://doi.org/10.1006/aama.2001.0789">Pattern frequency sequences and internal zeros</a>, Advances in Applied Mathematics 28 (2002), pp. 395-420.
%H M. Hildebrand, B. Sagan, and V. Vatter, <a href="https://doi.org/10.1016/j.aam.2004.01.002">Bounding quantities related to the packing density of 1(l+1)l...2</a>, Advances in Applied Mathematics, 33 (2004), pp. 633-653.
%F a(n) = max(a(k) + k*choose(n-k, 4), 1 <= k < n)
%e a(24) = 19381; the 24-permutation with the most copies of 15432 is 1, 5, 4, 3, 2, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6.
%Y Cf. A061061, A100354, A100356.
%K nonn
%O 1,6
%A _Vincent Vatter_, Nov 18 2004
|
