The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A141248 Number of points having minimal visibility in a square n X n lattice of points. 3
 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 36, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 9, 4, 4, 52, 4, 4, 8, 4, 4, 44, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 12, 4, 4, 4, 4, 1, 4, 4, 4, 4, 4, 4, 4, 1, 4, 4, 4, 20, 4, 4, 4, 4, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Sequence A141247 gives the minimum number of points visible from a point. By symmetry, when a(n) is odd, the central point in the lattice can see only the minimal number of points. When a(n)=1, the central point is the only such point. See A141249 for the n X n lattices that have such a central point. LINKS T. D. Noe, Table of n, a(n) for n=1..1000 MATHEMATICA Table[mn=n^2+1; pts=0; 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 17:12 EST 2022. Contains 358702 sequences. (Running on oeis4.)