login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; internal format)
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. Birkhauser, Basel, 1998, 2nd edition, p. 72.

CROSSREFS

Sequence in context: A174349 A099004 A055170 * A005940 A005941 A075164

Adjacent sequences:  A068381 A068382 A068383 * A068385 A068386 A068387

KEYWORD

hard,more,nonn,nice

AUTHOR

David Wasserman (dwasserm(AT)earthlink.net), Mar 05 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.