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 A166932 #31 Jan 14 2020 05:58:31 %S A166932 5,16,67,308,1493,5522 %N A166932 Lower bounds for minimal number of simplices in a triangulation of the n-dimensional cube (A019503). %C A166932 The terms are given in Table 1 on page 2 of the Glazyrin reference. %C A166932 There are many lists of bounds in different papers which differ by range, values, and methods used to obtain them. - _Andrey Zabolotskiy_, Nov 17 2017 %H A166932 A. Bliss, F. E. Su, <a href="http://arxiv.org/abs/math/0310142">Lower bounds for simplicial covers and triangulations of cubes</a>, arXiv:math/0310142 [math.CO], 2003 (see Table 1 page 4). %H A166932 A. Bliss, F. E. Su. <a href="https://doi.org/10.1007/s00454-004-1128-0">Lower bounds for simplicial covers and triangulations of cubes</a>, Discrete Comput. Geom. 33 (2005), 669-686. %H A166932 R. W. Cottle, <a href="http://dx.doi.org/10.1016/0012-365X(82)90185-6">Minimal triangulation of the 4-cube</a>, Discrete Math., 40(1):25-29, 1982. %H A166932 Alexey Glazyrin, <a href="http://arxiv.org/abs/0910.4200">Lower bounds for the simplexity of the n-cube</a>, arXiv:0910.4200 [math.MG], 2009-2012 (see Table 1 page 2). %H A166932 R. B. Hughes and M. R. Anderson, <a href="http://dx.doi.org/10.1016/0012-365X(95)00075-8">Simplexity of the cube</a>, Discrete Math., 158(1-3):99-150, 1996. %Y A166932 Cf. A019502, A019503, A019504. %K A166932 nonn,less %O A166932 3,1 %A A166932 _Jonathan Vos Post_, Oct 24 2009