This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A100354 #10 Jan 09 2024 10:53:58 %S A100354 0,0,0,1,4,10,20,40,70,112,168,252,360,495,661,881,1145,1457,1824, %T A100354 2279,2804,3404,4090,4906,5824,6850,8000,9330,10800,12417,14208,16232, %U A100354 18440,20840,23470,26395,29554,32956,36652,40712,45062,49712,54728,60184 %N A100354 Maximal number of 1432 patterns in a permutation of 1,2,...,n. %D A100354 W. Stromquist, Packing layered posets into posets, manuscript. %H A100354 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 A100354 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 A100354 a(n) = max(a(k) + k*choose(n-k, 3), 1 <= k < n) %e A100354 a(20) = 2279; the 20-permutation with the most copies of 1432 is 1, 5, 4, 3, 2, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6. %Y A100354 Cf. A061061, A100355, A100356. %K A100354 nonn %O A100354 1,5 %A A100354 _Vincent Vatter_, Nov 18 2004