login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141227 Maximum number of points visible from some point in a cubic n x n x n lattice. 1
1, 8, 27, 57, 111, 183, 303, 435, 633, 843, 1155, 1443, 1893, 2313, 2895, 3447, 4215, 4875, 5865, 6723, 7887, 8943, 10371, 11553, 13293, 14745, 16707, 18411, 20703, 22485, 25257, 27459, 30423, 32931, 36291, 38889, 42837, 45950, 50115, 53523 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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.

LINKS

Table of n, a(n) for n=1..40.

Eric Weisstein, MathWorld: Visible Point

FORMULA

The maximum number of visible points is slightly more than c*n^3, with c = 1/zeta(3) = 0.831907... (A088453).

MATHEMATICA

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}]

CROSSREFS

Cf. A141224.

Sequence in context: A250278 A223950 A131620 * A224134 A213488 A151675

Adjacent sequences:  A141224 A141225 A141226 * A141228 A141229 A141230

KEYWORD

nonn

AUTHOR

T. D. Noe, Jun 15 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified April 25 00:32 EDT 2017. Contains 285346 sequences.