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 A339947 #37 Mar 20 2021 13:50:29 %S A339947 1,5,5,13,5,33,23,30,25,69,23,150,79,119,161,385,125,501,178,443,548, %T A339947 1105,273,1119,921,1339,1202,2049,228,2237,2041,2792,2431,3096,1006, %U A339947 5905,4216,5230,3433,7596,1531,10026,6556,6939,8201,14190,3105,13431,7068,12673,12587,22075,4080,17211,13183,19462,18667,29950,2709,34199 %N A339947 Mark each point on the n X n X n X n grid with the number of points that are visible from it; a(n) is the number of distinct values in the grid. %H A339947 Bert Dobbelaere, <a href="/A339947/b339947.txt">Table of n, a(n) for n = 1..100</a> %H A339947 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/VisiblePoint.html">Visible Point</a> %e A339947 a(1) = 1 because there are 15 visible points from every point on the grid. %e A339947 a(2) = 5 because 65 points are visible from every vertex of the grid, 73 points are visible from the midpoint of every edge of the grid, 77 points are visible from the midpoint of every face of the grid, 79 points are visible from the midpoint of every cell of the grid, and 80 points are visible from the middle of the grid. %o A339947 (PARI) \\ n = side length, d = dimension %o A339947 cdvps(n, d) ={my(m=Map()); %o A339947 forvec(u=vector(d, i, [0, n\2]), %o A339947 my(c=0); forvec(v=[[t-n, t]|t<-u], c+=(gcd(v)==1)); %o A339947 mapput(m, c, 1), 1); %o A339947 #m; } %o A339947 a(n) = cdvps(n, 4) %Y A339947 Cf. A339400, A339756. %K A339947 nonn %O A339947 1,2 %A A339947 _Torlach Rush_, Dec 23 2020 %E A339947 More terms from _Bert Dobbelaere_, Mar 20 2021