The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052157 Least positive integer r such that there exists an integer s, 0 <= s < r gcd(r-i, s-j) > 1 for all integers i, j with 0 <= i, j < n. 0
 2, 21, 1310, 10199373 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS S. Laishram, F. Luca, Rectangles Of Nonvisible Lattice Points, J. Int. Seq. 18 (2015) 15.10.8 FORMULA a_n < e^{(1+o(1)) 2 n^2 log n}. EXAMPLE a(1) = 2 because we can choose r = 2, s = 0; a(2) = 21 because we can choose r = 21, s = 15; a(3) = 1310 because we can choose r = 1310, s = 1276. a(4) = 10199373: r = 10199373, s = 7247646. - William Rex Marshall, Nov 23 2009 PROG (PARI) is(r, n)=n--; my(s=[Mod(0, 1)], f, v, p); for(i=0, n, f=factor(r-i)[, 1]; for(j=0, n, v=List(); for(k=1, #f, p=f[k]; for(k=1, #s, if(s[k].mod%p, listput(v, chinese(Mod(j, p), s[k])), if(Mod(s[k], p)==j, listput(v, s[k]))))); s=select(m->lift(m) 410000. And also I know by constructing the pair (r, s) = (477742707, 172379781) that a(4) <= 477742707. a(4) > 1475000. - Jud McCranie, Jan 26 2000 a(4) from William Rex Marshall, Nov 23 2009 STATUS approved

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

Last modified April 13 09:12 EDT 2021. Contains 342935 sequences. (Running on oeis4.)