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 A100356 #11 Jan 09 2024 10:53:51 %S A100356 0,0,0,0,0,1,6,21,56,126,252,504,924,1584,2574,4004,6006,9009,13104, %T A100356 18564,25704,34884,46512,62016,81396,105336,134596,170016,212520, %U A100356 265650,328900,403650,491400,593775,712531,855037,1019467,1208257,1424017 %N A100356 Maximal number of 165432 patterns in a permutation of 1,2,...,n. %D A100356 W. Stromquist, Packing layered posets into posets, manuscript. %H A100356 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 A100356 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 A100356 a(n) = max(a(k) + k*choose(n-k, 5), 1 <= k < n) %e A100356 a(12) = 502; the 12-permutation with the most copies of 165432 is 2, 1, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3. %Y A100356 Cf. A061061, A100354, A100355. %K A100356 nonn %O A100356 1,7 %A A100356 _Vincent Vatter_, Nov 18 2004