|
Search: id:A068509
|
|
|
| A068509 |
|
a(n) = maximum length of a subset in {1,..,n} whose integers have pairwise l.c.m. not exceeding n. |
|
+0
1
|
|
| 1, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, B26.
|
|
FORMULA
|
(3*sqrt(n))/(2*sqrt(2)) - 2 < a(n) <= 1.638*sqrt(n) - P. Erdos and S. L. G. Choi
|
|
CROSSREFS
|
Sequence in context: A130249 A061071 A122258 this_sequence A070319 A057142 A098388
Adjacent sequences: A068506 A068507 A068508 this_sequence A068510 A068511 A068512
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Naohiro Nomoto (n_nomoto(AT)yabumi.com), Mar 12 2002
|
|
|
Search completed in 0.002 seconds
|
