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 A080832 #22 Jul 28 2018 10:38:09
%S A080832 1,1,3,13,67,421,3115,26349,250867,2655541,30929019,393019837,
%T A080832 5410699075,80221867909,1274393162827,21594697199757,388796268801427,
%U A080832 7411769447027413,149143210226032923,3159088788867736669
%N A080832 Expansion of e.g.f. exp(x) * (sec(exp(x) - 1))^2.
%C A080832 Take the smallest element from each block of the set partitions of {1,2,...,n+1} into an odd number of blocks. Form a "zag" permutation a[1],a[2],...,a[k] such that a[1] < a[2] > a[3] < ... > a[k]. a(n) is the number of ways to order the blocks in accordance with such "zag" permutations. - _Geoffrey Critzer_, Nov 23 2012
%H A080832 Muniru A Asiru, <a href="/A080832/b080832.txt">Table of n, a(n) for n = 0..100</a>
%H A080832 P. Flajolet and R. Sedgewick, <a href="http://algo.inria.fr/flajolet/Publications/books.html">Analytic Combinatorics</a>, 2009; see page 144
%F A080832 E.g.f.: exp(x) / (cos(exp(x) - 1))^2.
%F A080832 The sequence 0, 1, 1, 3, ... has e.g.f. tan(exp(x)-1). It has general term sum{k=0..n, S2(n, k) A009006(k)} for n>1 (S2(n, k) Stirling numbers of second kind). - _Paul Barry_, Apr 20 2005
%F A080832 a(n) ~ 2*n * n! / ((2+Pi) * (log(1+Pi/2))^(n+2)). - _Vaclav Kotesovec_, Jul 28 2018
%p A080832 seq(coeff(series(factorial(n)*exp(x)*(sec(exp(x)-1))^2, x,n+1),x,n),n=0..25); # _Muniru A Asiru_, Jul 28 2018
%t A080832 nn=21;t=Sum[n^(n-1)x^n/n!,{n,1,nn}];Drop[Range[0,nn]!CoefficientList[ Series[Tan[Exp[x]-1],{x,0,nn}],x],1] (* _Geoffrey Critzer_, Nov 23 2012 *)
%Y A080832 Cf. A000182, A219613.
%K A080832 easy,nonn
%O A080832 0,3
%A A080832 _Emanuele Munarini_, Mar 28 2003