login
The OEIS is supported by the many generous donors 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; text; 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. Birkhäuser, Basel, 1998, 2nd edition, p. 72.
LINKS
CROSSREFS
Sequence in context: A360413 A270194 A055170 * A222253 A353591 A269838
KEYWORD
nonn,hard,more,nice
AUTHOR
David Wasserman, Mar 05 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)