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.
%I A141227 #3 Feb 16 2025 08:33:08
%S A141227 1,8,27,57,111,183,303,435,633,843,1155,1443,1893,2313,2895,3447,4215,
%T A141227 4875,5865,6723,7887,8943,10371,11553,13293,14745,16707,18411,20703,
%U A141227 22485,25257,27459,30423,32931,36291,38889,42837,45950,50115,53523
%N A141227 Maximum number of points visible from some point in a cubic n x n x n lattice.
%C A141227 Two points (a,b,c) and (d,e,f) are visible to each other when gcd(d-a,e-b,f-c)=1. Sequence A141228 gives the number of lattice points that have maximal visibility.
%H A141227 Eric Weisstein, <a href="https://mathworld.wolfram.com/VisiblePoint.html">MathWorld: Visible Point</a>
%F A141227 The maximum number of visible points is slightly more than c*n^3, with c = 1/zeta(3) = 0.831907... (A088453).
%t A141227 Table[mx=0; Do[cnt=0; Do[If[GCD[d-a,e-b,f-c]<2, cnt++ ], {a,n}, {b,n}, {c,n}]; If[cnt>mx, mx=cnt], {d,n}, {e,n}, {f,n}]; mx, {n,10}]
%Y A141227 Cf. A141224.
%K A141227 nonn
%O A141227 1,2
%A A141227 _T. D. Noe_, Jun 15 2008