|
Search: id:A006248
|
|
|
| A006248 |
|
Number of primitive sorting networks on n elements. Number of projective pseudo order types: simple arrangements of pseudo-lines.
(Formerly M3428)
|
|
+0
4
|
|
| 1, 1, 1, 1, 1, 4, 11, 135, 4382, 312356, 41848591
(list; graph; listen)
|
|
|
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.
D. E. Knuth, Axioms and Hulls, Lect. Notes Comp. Sci., Vol. 606.
|
|
LINKS
|
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 13-th Canadian Conference on Computational Geometry (CCCG '01), Waterloo, Aug. 13-15, 2001.
Index entries for sequences related to sorting
|
|
CROSSREFS
|
Cf. A006245, A006246, A018242, A063666. A diagonal of A063851.
Sequence in context: A125888 A055979 A018242 this_sequence A119571 A089920 A118197
Adjacent sequences: A006245 A006246 A006247 this_sequence A006249 A006250 A006251
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
a(11) from Franz Aurenhammer (auren(AT)igi.tu-graz.ac.at), Feb 05, 2002
|
|
|
Search completed in 0.002 seconds
|
