login

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”).

A334891
Number of ways to choose 4 points that form a square from the A000292(n) points in a regular tetrahedral grid where each side has n vertices.
0
0, 0, 3, 12, 36, 84, 174, 336, 612, 1044, 1701
OFFSET
0,3
COMMENTS
a(n) >= 3*A001752(n-2).
EXAMPLE
For n = 4, three of the a(4) = 36 squares are (in barycentric coordinates)
{(0,2,1,1),(1,1,0,2),(1,1,2,0),(2,0,1,1)},
{(0,0,2,2),(0,2,0,2),(2,0,2,0),(2,2,0,0)}, and
{(0,0,1,3),(0,1,0,3),(1,0,1,2),(1,1,0,2)}.
The other squares can be derived from these by translations or symmetries of the tetrahedron.
CROSSREFS
Cf. A334581 (equilateral triangle), A334881 (cubic grid).
Sequence in context: A135190 A101069 A225259 * A242526 A167667 A292291
KEYWORD
nonn,more
AUTHOR
Peter Kagey, May 14 2020
STATUS
approved