cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A141248 Number of points having minimal visibility in a square n X n lattice of points.

Original entry on oeis.org

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
Offset: 1

Views

Author

T. D. Noe, Jun 17 2008

Keywords

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.

Crossrefs

Cf. A141225.

Programs

  • 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
    				
Showing 1-1 of 1 results.