|
Search: id:A062571
|
|
|
| A062571 |
|
a(n) = minimum over m of the size of the largest subset of pairwise relatively prime numbers in {m, m+1, m+2, ..., m+n}. |
|
+0
2
|
|
| 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
P. Erdos and J. L. Selfridge, Complete prime subsets of consecutive integers, Proc. Conf. Numerical Maths, Winnipeg (1971), p. 13
|
|
EXAMPLE
|
a(5) = 3 because the largest pairwise relatively prime subset of {2,3,4,5,6} is of size 3 (e.g. {2,3,5}) and any 5 consecutive integers must contain at least 3 that are relatively prime
|
|
CROSSREFS
|
Cf. A062575.
Sequence in context: A098388 A094235 A137397 this_sequence A102515 A066063 A123087
Adjacent sequences: A062568 A062569 A062570 this_sequence A062572 A062573 A062574
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca), Jul 03 2001
|
|
|
Search completed in 0.002 seconds
|
