|
%I #24 Oct 14 2022 07:12:43
%S 1,2,5,37,1142,162004
%N Number of 4-dimensional simplicial convex polytopes with n nodes.
%H Firsching, Moritz <a href="https://doi.org/10.1007/s10107-017-1120-0">Realizability and inscribability for simplicial polytopes via nonlinear optimization</a>. Math. Program. 166, No. 1-2 (A), 273-295 (2017). Table 1
%H Moritz Firsching, <a href="https://doi.org/10.1007/s11856-020-2070-4">The complete enumeration of 4-polytopes and 3-spheres with nine vertices</a>, Israel Journal of Mathematics 240, 417-441 (2020); arXiv:<a href="https://arxiv.org/abs/1803.05205">1803.05205</a> [math.MG], 2018.
%H Komei Fukuda, Hiroyuki Miyata and Sonoko Moriyama, <a href="https://doi.org/10.1007/s00454-012-9470-0">Complete Enumeration of Small Realizable Oriented Matroids</a>. Discrete Comput. Geom. 49 (2013), no. 2, 359--381. MR3017917. Also arXiv:<a href="https://arxiv.org/abs/1204.0645">1204.0645</a> [math.CO], 2012.
%Y Cf. A000109, A005841.
%K nonn,more
%O 5,2
%A _N. J. A. Sloane_, Feb 16 2013
%E Changed "4" to "n" in description of sequence. - _Moritz Firsching_, Apr 02 2015
%E a(10) from M. Firsching's paper added by _Andrey Zabolotskiy_, Jun 28 2022
|
