OFFSET
1,6
REFERENCES
J. Bokowski, personal communication.
J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, CRC Press, 1997, p. 102.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
J. Bokowski & N. J. A. Sloane, Emails, June 1994
Stefan Felsner and Jacob E. Goodman, Pseudoline Arrangements, Chapter 5 of Handbook of Discrete and Computational Geometry, CRC Press, 2017, see Table 5.6.1. [Specific reference for this sequence] - N. J. A. Sloane, Nov 14 2023
S. Felsner and J. E. Goodman, Pseudoline Arrangements. In: Toth, O'Rourke, Goodman (eds.) Handbook of Discrete and Computational Geometry, 3rd edn. CRC Press, 2018.
J. Ferté, V. Pilaud and M. Pocchiola, On the number of simple arrangements of five double pseudolines, arXiv:1009.1575 [cs.CG], 2010; Discrete Comput. Geom. 45 (2011), 279-302.
Lukas Finschi, A Graph Theoretical Approach for Reconstruction and Generation of Oriented Matroids, A dissertation submitted to the Swiss Federal Institute of Technology, Zurich for the degree of Doctor of Mathematics, 2001.
L. Finschi, Homepage of Oriented Matroids
L. Finschi and K. Fukuda, Complete combinatorial generation of small point set configurations and hyperplane arrangements, pp. 97-100 in Abstracts 13th Canadian Conference on Computational Geometry (CCCG '01), Waterloo, Aug. 13-15, 2001.
Komei Fukuda, Hiroyuki Miyata, and Sonoko Moriyama, Complete Enumeration of Small Realizable Oriented Matroids, arXiv:1204.0645 [math.CO], 2012; Discrete Comput. Geom. 49 (2013), no. 2, 359--381. MR3017917. - From N. J. A. Sloane, Feb 16 2013
Jacob E. Goodman, Joseph O'Rourke, and Csaba D. Tóth, editors, Handbook of Discrete and Computational Geometry, CRC Press, 2017, see Table 5.6.1. [General reference for 2017 edition of the Handbook] - N. J. A. Sloane, Nov 14 2023
D. E. Knuth, Axioms and Hulls, Lect. Notes Comp. Sci., Vol. 606, Springer-Verlag, Berlin, Heidelberg, 1992, p.35, entry E_n.
FORMULA
Asymptotics: 2^{Cn^2} <= a(n) <= 2^{Dn^2} for every n >= N, where N,C,D are constants with 1<C<D . For more information see e.g. Felsner and Goodman. - Manfred Scheucher, Sep 12 2019 [reformulated by Günter Rote, Dec 01 2021]
CROSSREFS
KEYWORD
nonn,nice,hard
AUTHOR
EXTENSIONS
a(11) from Franz Aurenhammer (auren(AT)igi.tu-graz.ac.at), Feb 05 2002
a(12) from Manfred Scheucher and Günter Rote, Sep 07 2019
Definition corrected by Günter Rote, Dec 01 2021
STATUS
approved