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 A032346 #24 Nov 01 2019 02:57:39
%S A032346 1,1,2,6,21,82,354,1671,8536,46814,273907,1700828,11158746,77057021,
%T A032346 558234902,4230337018,33448622893,275322101318,2354401779494,
%U A032346 20878592918183,191682453823420,1819147694792802,17822073621801123
%N A032346 Essentially shifts 1 place right under inverse binomial transform.
%C A032346 With leading 0 and offset 1, number of permutations beginning with 21 and avoiding 3-12. - _Ralf Stephan_, Apr 25 2004
%H A032346 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A032346 Sergey Kitaev, <a href="https://www.emis.de/journals/SLC/wpapers/s48kitaev.html">Generalized pattern avoidance with additional restrictions</a>, Sem. Lothar. Combinat. 48 (2003), Article B48e.
%H A032346 Sergey Kitaev, <a href="http://dx.doi.org/10.1016/j.disc.2004.03.017">Partially Ordered Generalized Patterns</a>, Discrete Math. 298(1-3) (2005), 212-229.
%H A032346 Sergey Kitaev and Toufik Mansour, <a href="https://arxiv.org/abs/math/0205182">Simultaneous avoidance of generalized patterns</a>, arXiv:math/0205182 [math.CO], 2002.
%F A032346 With offset 1, e.g.f.: x + exp(exp(x)) * int[0..x, exp(-exp(t))*sum(n>=1, t^n/n!) dt]. - _Ralf Stephan_, Apr 25 2004
%t A032346 max = 23; f[x_] = x + Exp[Exp[x]]*Integrate[Exp[-Exp[t]]*Sum[t^n/n!, {n, 1, max}], {t, 0, x}]; Rest[ CoefficientList[ Series[f[x], {x, 0, max}], x]*Range[0, max]!] (* _Jean-François Alcover_, Aug 07 2012, after _Ralf Stephan_ *)
%Y A032346 Cf. A032347, A046934.
%K A032346 nonn,nice,easy,eigen
%O A032346 0,3
%A A032346 Joe K. Crump (joecr(AT)carolina.rr.com)
%E A032346 Last digit of a(22) corrected by _Jean-François Alcover_, Aug 07 2012