|
|
A018242
|
|
Number of projective order types; number of simple arrangements of n lines.
|
|
5
|
|
|
1, 1, 1, 1, 1, 1, 4, 11, 135, 4381, 312114, 41693377
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,7
|
|
REFERENCES
|
J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, CRC Press, 1997, p. 102.
|
|
LINKS
|
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
|
|
FORMULA
|
Asymptotics: a(n) = 2^(Theta(n log n)). This is Bachmann-Landau notation, that is, there are constants n_0, c, and d, such that for every n >= n_0 the inequality 2^(c n log n) <= a(n) <= 2^(d n log n) is satisfied. For more information see e.g. the Handbook of Discrete and Computational Geometry. - Manfred Scheucher, Sep 12 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(11) from Franz Aurenhammer (auren(AT)igi.tu-graz.ac.at), Feb 05 2002
|
|
STATUS
|
approved
|
|
|
|