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 A328501 #13 Aug 21 2020 17:31:39 %S A328501 1,1,2,6,24,118,684,4548,34036,282696,2577936,25589100,274539856, %T A328501 3164909164,39006958856,511759353776,7120140764224,104703385864788, %U A328501 1622530610142744,26425922582118000,451264786489454168,8062192403534869432,150395837509736576208 %N A328501 Number of inversion sequences of length n avoiding the consecutive pattern 201. %H A328501 Vaclav Kotesovec, <a href="/A328501/b328501.txt">Table of n, a(n) for n = 0..465</a> %H A328501 Juan S. Auli, <a href="https://search.proquest.com/openview/3f0cef1fbdb016d61e16412e4b855969/1">Pattern Avoidance in Inversion Sequences</a>, Ph. D. thesis, Dartmouth College, ProQuest Dissertations Publishing (2020), 27964164. %H A328501 Juan S. Auli, Sergi Elizalde, <a href="https://arxiv.org/abs/1904.02694">Consecutive Patterns in Inversion Sequences</a>, arXiv:1904.02694 [math.CO], 2019. See Table 3. %F A328501 a(n) ~ n! * c * d^n * n^alfa, where d = 1/A240885 = 1/(sqrt(2) * InverseErf(sqrt(2/Pi))) = 0.783976931203547499124248654869812535747328200022..., alfa = 1.9218908815253415257398764962146978742409244378248756048362586275529..., c = 0.05831456121798260255226478044037424484656774525125436523149657... - _Vaclav Kotesovec_, Oct 18 2019 %Y A328501 Cf. A049774, A071075, A200404. %K A328501 nonn %O A328501 0,3 %A A328501 _Vaclav Kotesovec_ and _Juan S. Auli_, Oct 17 2019