|
Search: id:A094708
|
|
|
| A094708 |
|
Size of the smallest set hitting all {x, 2x, 3x} contained in D(n) = the first n 3-smooth numbers {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27,...} (A003586). |
|
+0
4
|
|
| 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
COMMENT
|
A057561(n) = n - a(n) [From S. R. Finch (Steven.Finch(AT)inria.fr), Feb 25 2009]
|
|
REFERENCES
|
F. Chung, P. Erdos and R. L. Graham, On Sparse Sets Hitting Linear Forms, in Number Theory for the Millennium I (M. A. Bennett et al., eds.), pp. 257-272.
|
|
LINKS
|
S. R. Finch, Triple-Free Sets of Integers
|
|
CROSSREFS
|
A057561 [From S. R. Finch (Steven.Finch(AT)inria.fr), Feb 25 2009]
Sequence in context: A028829 A130855 A100196 this_sequence A039730 A152595 A085182
Adjacent sequences: A094705 A094706 A094707 this_sequence A094709 A094710 A094711
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Barry Cipra (bcipra(AT)rconnect.com), Jun 15 2004
|
|
|
Search completed in 0.002 seconds
|
