|
|
A234249
|
|
Number of ways to choose 4 points in an n X n X n triangular grid.
|
|
11
|
|
|
15, 210, 1365, 5985, 20475, 58905, 148995, 341055, 720720, 1426425, 2672670, 4780230, 8214570, 13633830, 21947850, 34389810, 52602165, 78738660, 115584315, 166695375, 236561325, 330791175, 456326325, 621682425, 837222750, 1115465715, 1471429260, 1923014940
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
All elements of the sequence are multiples of 15.
a(n-1) is the number of chiral pairs of colorings of the 8 cubic facets of a tesseract (hypercube) with Schläfli symbol {4,3,3} or of the 8 vertices of a hyperoctahedron with Schläfli symbol {3,3,4}. Both figures are regular 4-D polyhedra and they are mutually dual. Each member of a chiral pair is a reflection, but not a rotation, of the other. - Robert A. Russell, Oct 20 2020
|
|
LINKS
|
|
|
FORMULA
|
a(n) = n*(n + 1)*(n - 1)*(n + 2)*(n - 2)*(n + 3)*(n^2 + n - 4)/384.
a(n) = C(C(n + 1, 2), 4).
G.f.: -15*x^3*(x^2+5*x+1) / (x-1)^9. - Colin Barker, Feb 02 2014
a(n-1) = 15*C(n,4) + 135*C(n,5) + 330*C(n,6) + 315*C(n,7) + 105*C(n,8), where the coefficient of C(n,k) is the number of chiral pairs of colorings using exactly k colors.
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) Vec(-15*x^3*(x^2+5*x+1)/(x-1)^9 + O(x^100)) \\ Colin Barker, Feb 02 2014
|
|
CROSSREFS
|
Cf. A337956 (oriented), A337956 (unoriented), A337956 (achiral) colorings, A331356 (hyperoctahedron edges, tesseract faces), A331360 (hyperoctahedron faces, tesseract edges), A337954 (hyperoctahedron facets, tesseract vertices).
Row 4 of A325006 (orthotope facets, orthoplex vertices).
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|