Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Mar 17 2021 23:33:15
%S 0,8,80,416,1512,4216,10000,21256
%N Number of ways to choose 3 points that form an equilateral triangle from the A001845(n) points in a regular octahedral grid of size n.
%C The octahedral grid of side length n is the set of points (x,y,z) in Z^3 such that |x|+|y|+|z| <= n. The number of points in this grid is given by A001845(n).
%e For n = 1, the a(1) = 8 equilateral triangles are given by the convex hulls of {(+-1,0,0),(0,+-1,0),(0,0,+-1)}.
%Y Cf. A001845.
%Y Cf. A102698 and A334581 are analogous for the cubic grid and tetrahedral grid respectively.
%K nonn,more
%O 0,2
%A _Peter Kagey_, Mar 08 2021