OFFSET
1,1
COMMENTS
A finite sequence of n consecutive positive integers is called "stapled" if each element in the sequence is not relatively prime to at least one other element in the sequence.
In other words, an interval is stapled if for every element x there is another element y (different from x) such that gcd(x,y)>1.
The shortest stapled interval has length 17 and starts with the number 2184.
It is interesting to notice that the intervals [27829,27846] and [27828,27846] are stapled while the interval [27828,27845] is not.
It is clear that a stapled interval [a,b] may not contain a prime number greater than b/2 (as such a prime would be coprime to every other element of the interval).
Together with Bertrand's Postulate this implies a>b/2 or b<2a. And it follows that
* a stapled interval may not contain prime numbers at all;
* for any particular positive integer a, we can determine if it is a starting point of some stapled interval.
REFERENCES
H. L. Nelson, There is a better sequence, Journal of Recreational Mathematics, Vol. 8(1), 1975, pp. 39-43.
LINKS
Fidel I. Schaposnik, Table of n, a(n) for n = 1..1492 (first 76 terms from Max Alekseyev)
A. Brauer, On a Property of k Consecutive Integers, Bull. Amer. Math. Society, vol. 47, 1941, pp. 328-331.
R. J. Evans, On Blocks of N Consecutive Integers, Amer. Math. Monthly, vol. 76, 1969, pp. 48-49.
Irene Gassko, Stapled Sequences and Stapling Coverings of Natural Numbers, Electronic Journal of Combinatorics, Vol. 3, 1996, Paper R33.
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
Max Alekseyev, Jul 24 2007
STATUS
approved