|
Search: id:A068384
|
|
|
| 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
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(9) >= 17. For n >= 10, a(n) >= n + 2. a(n) <= n^(3n) for all n.
|
|
REFERENCES
|
G. Gratzer, General Lattice Theory. Birkhauser, Basel, 1998, 2nd edition, p. 72.
|
|
CROSSREFS
|
Sequence in context: A141655 A099004 A055170 this_sequence A005940 A005941 A075164
Adjacent sequences: A068381 A068382 A068383 this_sequence A068385 A068386 A068387
|
|
KEYWORD
|
hard,more,nonn,nice
|
|
AUTHOR
|
David Wasserman (dwasserm(AT)earthlink.net), Mar 05 2002
|
|
|
Search completed in 0.002 seconds
|
