login
A339756
Mark each point on the 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.
2
1, 4, 4, 8, 4, 17, 12, 15, 14, 33, 12, 58, 28, 43, 52, 113, 39, 140, 57, 124, 129, 240, 66, 241, 173, 270, 217, 362, 58, 388, 292, 454, 351, 539, 166, 783, 471, 723, 463, 880, 229, 1134, 642, 843, 763, 1441, 311, 1415, 740, 1295, 987, 1888, 357, 1629, 1063, 1750, 1231, 2381, 289, 2652
OFFSET
1,2
COMMENTS
a(n) <= A058187(n). This is because A058187(n) is the maximum number of points required to calculate a(n).
LINKS
Eric Weisstein's World of Mathematics, Visible Point
EXAMPLE
a(1) = 1 because there are 7 visible points from every point on the grid.
a(2) = 4 because 19 points are visible from every vertex of the grid, 23 points are visible from the midpoint of every edge of the grid, 25 points are visible from the midpoint of every face of the grid, and 26 points are visible from the middle of the grid.
a(3) = 4 because 49 points are visible from every vertex of the grid, 53 points are visible from the inner points of every edge of the grid, 55 points are visible from the inner points of every face of the grid, and 56 points are visible from the inner points of the grid.
PROG
(PARI) \\ n = side length, d = dimension
cdvps(n, d) ={my(m=Map());
forvec(u=vector(d, i, [0, n\2]),
my(c=0); forvec(v=[[t-n, t]|t<-u], c+=(gcd(v)==1));
mapput(m, c, 1), 1);
#m; }
a(n) = cdvps(n, 3)
CROSSREFS
KEYWORD
nonn
AUTHOR
Torlach Rush, Dec 15 2020
STATUS
approved