|
|
COMMENTS
|
Sometimes called Hosten-Morris numbers.
Also the number of simplicial complexes on the set {1, ..., n-1} such that no pair of faces covers all of {1, ..., n-1}. [Miller-Sturmfels]. - N. J. A. Sloane, Feb 18 2008
Also the maximal number of generators of a neighborly monomial ideal in n variables. [Miller-Sturmfels]. - N. J. A. Sloane, Feb 18 2008
Also the number of intersecting antichains on a labeled (n-1)-set or (n-1)-variable Boolean functions in the Post class F(7,2). Cf. A059090. - Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs), Dec 28 2000
Also the number of nondominated coteries on n members. - D. E. Knuth Sep 01 2005
The number of maximal families of intersecting subsets of an n element set. - Bridget Tenner, Nov 16 2006
|
|
|
REFERENCES
|
Jan C. Bioch and Toshihide Ibaraki, Generating and approximating nondominated coteries, IEEE Transactions on parallel and distributed systems, 6 (1995), 905-914.
A. E. Brouwer and A. Verbeek, Counting families of mutually intersecting sets, Report ZN 41, March 1972, Math. Centr., Amsterdam. Gives a(n) for n <= 7.
Hosten, Serkan and Morris, Walter D., Jr., The order dimension of the complete graph, Discrete Math. 201 (1999), 133-139.
Jovovic, V. and Kilibarda, G., The number of n-variable Boolean functions in the Post class F(7,2), Belgrade, 2001, in preparation.
D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.1, p. 79.
W. F. Lunnon, The IU function: the size of a free distributive lattice, pp. 173-181 of D. J. A. Welsh, editor, Combinatorial Mathematics and Its Applications. Academic Press, NY, 1971.
Charles F. Mills and W. M. Mills, The calculation of λ(8), preprint, 1979. Gives a(8).
E. Miller and B. Sturmfels, Combinatorial Commutative Algebra, Springer, 2005.
Rivière, N. M. Recursive formulas on free distributive lattices. J. Combinatorial Theory 5 1968 229--234. MR0231764 (38 #92). Gives a(n) for n <= 5. - From N. J. A. Sloane, May 12 2012
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
Table of n, a(n) for n=0..9.
D. E. Loeb, Challenges in playing multiplayer games, in Levy and Beal, editors, Heuristic Programming in Artificial Intelligence, vol. 4, Ellis Horwood, 1994.
D. E. Loeb and A. Meyerowitz, The maximal intersecting family of sets graph, in H. Barcelo and G. Kalai, editors, Proceedings of the Conference on Jerusalem Combinatorics 1993. AMS series Contemporary Mathematics, 1994.
Index entries for sequences related to Boolean functions
|
