login
A068384
a(n) is the smallest number m such that any lattice having at least m elements must have a sublattice with exactly n elements.
0
1, 2, 3, 4, 5, 6, 9, 8
OFFSET
1,2
COMMENTS
a(9) >= 17. For n >= 10, a(n) >= n + 2. a(n) <= n^(3n) for all n.
REFERENCES
G. Gratzer, General Lattice Theory. Birkhäuser, Basel, 1998, 2nd edition, p. 72.
CROSSREFS
Sequence in context: A360413 A270194 A055170 * A222253 A353591 A269838
KEYWORD
nonn,hard,more,nice
AUTHOR
David Wasserman, Mar 05 2002
STATUS
approved