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!)
 A141247 Minimum number of points visible from a point in a square n X n lattice. 2
 1, 4, 6, 10, 14, 22, 26, 38, 46, 58, 66, 86, 94, 118, 130, 146, 162, 194, 206, 241, 257, 282, 302, 346, 362, 401, 426, 462, 486, 542, 558, 609, 641, 690, 722, 770, 794, 861, 899, 950, 982, 1062, 1086, 1157, 1201, 1258, 1302, 1393, 1425, 1501, 1546, 1613 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Two points (a,b) and (c,d) are visible to each other when gcd(c-a,d-b)=1. Sequence A141248 gives the number of lattice points that have minimal visibility. LINKS T. D. Noe, Table of n, a(n) for n=1..1000 Eric Weisstein, MathWorld: Visible Point FORMULA The minimum number of visible points is slightly less than c*n^2, with c = 6/pi^2. MATHEMATICA Table[mn=n^2+1; Do[cnt=0; Do[If[GCD[c-a, d-b]<2, cnt++ ], {a, n}, {b, n}]; If[cnt

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 July 24 11:51 EDT 2021. Contains 346273 sequences. (Running on oeis4.)