A331360 -id:A331360 - cp's OEIS frontend

A331359 Number of unoriented colorings of the edges of a tesseract with n available colors.

1, 11251322, 4825746875682, 48038446526132256, 60632984344185045000, 20725680132763499134746, 2876113738439693827763387, 206323339930086669420462592, 8941884949194537156253481511

Offset: 1

Robert A. Russell, Jan 14 2020

A tesseract is a regular 4-dimensional orthotope or hypercube with 16 vertices and 32 edges. Its Schläfli symbol is {4,3,3}. Two unoriented colorings are the same if congruent; chiral pairs are counted as one. Also the number of unoriented colorings of the triangular faces of a regular 4-dimensional orthoplex {3,3,4} with n available colors.

Index entries for linear recurrences with constant coefficients, signature (33, -528, 5456, -40920, 237336, -1107568, 4272048, -13884156, 38567100, -92561040, 193536720, -354817320, 573166440, -818809200, 1037158320, -1166803110, 1166803110, -1037158320, 818809200, -573166440, 354817320, -193536720, 92561040, -38567100, 13884156, -4272048, 1107568, -237336, 40920, -5456, 528, -33, 1)

Cf. A331358 (oriented), A331360 (chiral), A331361 (achiral).

Cf. A063843 (simplex), A331355 (orthoplex), A338953 (24-cell), A338965 (120-cell, 600-cell).

Table[(48n^4 + 64n^6 + 164n^8 + 32n^12 + 35n^16 + 24n^18 + 16n^20 + n^32)/384, {n, 1, 25}]

a(n) = (48*n^4 + 64*n^6 + 164*n^8 + 32*n^12 + 35*n^16 + 24*n^18 + 16*n^20 + n^32) / 384.
a(n) = C(n,1) + 11251320*C(n,2) + 4825713121719*C(n,3) + 48019143606137456*C(n,4) + 60392840368910627325*C(n,5) + 20362602706881512104770*C(n,6) + 2732305589004849709507320*C(n,7) + 183891356981584237730865120*C(n,8) + 7186781660980022442696996900*C(n,9) + 179941570950595830458653229400*C(n,10) + 3092495918800698593432175049200*C(n,11) + 38355721930679608007610435655200*C(n,12) + 356388702642082232961224416430400*C(n,13) + 2552262270629849366778056301033600*C(n,14) + 14398742619650679721666540905600000*C(n,15) + 65081946248235516086688061276416000*C(n,16) + 238774230958640327164289928460608000*C(n,17) + 718111905257279424242461614311808000*C(n,18) + 1783226074397879202567353905547520000*C(n,19) + 3674025240535453233878734112386560000*C(n,20) + 6297428247692138525542940292326400000*C(n,21) + 8984640042458034573900227275929600000*C(n,22) + 10651431202956156039912718487654400000*C(n,23) + 10448264801973961157855568414105600000*C(n,24) + 8418935641672774875938561280000000000*C(n,25) + 5510766716064148076659382317056000000*C(n,26) + 2882400456553496466714071801856000000*C(n,27) + 1175640370514915165746352603136000000*C(n,28) + 360177463966855890088916582400000000*C(n,29) + 77945658076061560043023564800000000*C(n,30) + 10621166594979816972895518720000000*C(n,31) + 685236554514826901477130240000000*C(n,32), where the coefficient of C(n,k) is the number of colorings using exactly k colors.
a(n) = A331358(n) - A331360(n) = (A331358(n) - A331361(n)) / 2 = A331360(n) + A331361(n).

A234249 Number of ways to choose 4 points in an n X n X n triangular grid.

Original entry on oeis.org

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

Offset: 3

Heinrich Ludwig, Feb 02 2014

Sequence is column #5 of A084546: a(n) = A084546(n+1, 4).
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

Heinrich Ludwig, Table of n, a(n) for n = 3..1000
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).

Cf. A084546, A050534 (number of ways to choose 2 points), A093566 (3 points), A231653.
Cf. A337956 (oriented), A337956 (unoriented), A337956 (achiral) colorings, A331356 (hyperoctahedron edges, tesseract faces), A331360 (hyperoctahedron faces, tesseract edges), A337954 (hyperoctahedron facets, tesseract vertices).
Other polychora: A000389 (5-cell), A338950 (24-cell), A338966 (120-cell, 600-cell).
Row 4 of  A325006 (orthotope facets, orthoplex vertices).

A234249:=n->n*(n + 1)*(n - 1)*(n + 2)*(n - 2)*(n + 3)*(n^2 + n - 4)/384: seq(A234249(n), n=3..40); # Wesley Ivan Hurt, Jan 10 2017

Table[Binomial[Binomial[n,2],4], {n,4,30}] (* Robert A. Russell, Oct 20 2020 *)

Vec(-15*x^3*(x^2+5*x+1)/(x-1)^9 + O(x^100)) \\ Colin Barker, Feb 02 2014

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
From Robert A. Russell, Oct 20 2020: (Start)
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.
a(n-1) = A337956(n) - A337957(n) = (A337956(n) - A337958(n)) / 2 = A337957(n) - A337958(n).
a(n-1) = A325006(4,n). (End)

A331356 Number of chiral pairs of colorings of the edges of a regular 4-dimensional orthoplex with n available colors.

Original entry on oeis.org

0, 40927, 731279799, 732272925320, 155180061396500, 12338466190481025, 498892380429882397, 12297640855782563904, 207723543409061974215, 2604156223742219218875, 25650287482426463967550, 207022761847763612943192

Offset: 1

Robert A. Russell, Jan 14 2020

A regular 4-dimensional orthoplex (also hyperoctahedron or cross polytope) has 8 vertices and 24 edges. Its Schläfli symbol is {3,3,4}. The chiral colorings of its edges come in pairs, each the reflection of the other. Also the number of chiral pairs of colorings of the square faces of a tesseract {4,3,3} with n available colors.

Index entries for linear recurrences with constant coefficients, signature (25, -300, 2300, -12650, 53130, -177100, 480700, -1081575, 2042975, -3268760, 4457400, -5200300, 5200300, -4457400, 3268760, -2042975, 1081575, -480700, 177100, -53130, 12650, -2300, 300, -25, 1).

Cf. A331354 (oriented), A331355 (unoriented), A331357 (achiral).
Other polychora: A331352 (5-cell), A331360 (8-cell), A338954 (24-cell), A338966 (120-cell, 600-cell).
Row 4 of A337413 (orthoplex edges, orthotope ridges) and A337889 (orthotope faces, orthoplex peaks).

Table[(48n^3 - 20n^6 - 60n^7 + 8n^8 + 12n^9 - 3n^12 + 12n^13 + 18n^14 - 12n^15 - 4n^18 + n^24)/384, {n, 1, 25}]

a(n) = (48*n^3 - 20*n^6 - 60*n^7 + 8*n^8 + 12*n^9 - 3*n^12 + 12*n^13 + 18*n^14 - 12*n^15 - 4*n^18 + n^24) / 384.
a(n) = 40927*C(n,2) + 731157018*C(n,3) + 729348051686*C(n,4) + 151526009158620*C(n,5) + 11418355290999750*C(n,6) + 415756294427389020*C(n,7) + 8643340000393019040*C(n,8) + 113987930725267657695*C(n,9) + 1022999668724320645050*C(n,10) + 6559258733377155798300*C(n,11) + 31097930936416379343000*C(n,12) + 111710735118080165667600*C(n,13) + 309231158315533166512800*C(n,14) + 666846639586795403736000*C(n,15) + 1126625894182469352672000*C(n,16) + 1492173540716221595232000*C(n,17) + 1541987121926231652672000*C(n,18) + 1229356526029003532160000*C(n,19) + 741102367008078915840000*C(n,20) + 326583680209195368960000*C(n,21) + 99234043419574103040000*C(n,22) + 18581137031073576960000*C(n,23) + 1615751046180311040000*C(n,24), where the coefficient of C(n,k) is the number of colorings using exactly k colors.
a(n) = A331354(n) - A331355(n) = (A331354(n) - A331357(n)) / 2 = A331355(n) - A331357(n).

A331358 Number of oriented colorings of the edges of a tesseract with n available colors.

Original entry on oeis.org

1, 22409620, 9651199594275, 96076801068337216, 121265960728368199375, 41451359960612034644436, 5752227470227262715982165, 412646679764073090531066880, 17883769897375781105874361581

Offset: 1

Robert A. Russell, Jan 14 2020

A tesseract is a regular 4-dimensional orthotope or hypercube with 16 vertices and 32 edges. Its Schläfli symbol is {4,3,3}. Two oriented colorings are the same if one is a rotation of the other; chiral pairs are counted as two. Also the number of oriented colorings of the triangular faces of a regular 4-dimensional orthoplex {3,3,4} with n available colors.
There are 192 elements in the rotation group of the tesseract. Each is associated with a partition of 4 based on the conjugacy group of the permutation of the axes. The first formula is obtained by averaging their cycle indices after replacing x_i^j with n^j according to the Pólya enumeration theorem.
  Partition  Count  Even Cycle Indices
  4          6      8x_8^4
  31         8      4x_1^2x_3^10 + 4x_2^1x_6^5
  22         3      4x_2^16 + 4x_4^8
  211        6      4x_1^4x_2^14 + 4x_4^8
  1111       1      x_1^32 + 7x_2^16

G. Royle, Partitions and Permutations
Index entries for linear recurrences with constant coefficients, signature (33, -528, 5456, -40920, 237336, -1107568, 4272048, -13884156, 38567100, -92561040, 193536720, -354817320, 573166440, -818809200, 1037158320, -1166803110, 1166803110, -1037158320, 818809200, -573166440, 354817320, -193536720, 92561040, -38567100, 13884156, -4272048, 1107568, -237336, 40920, -5456, 528, -33, 1).

Cf. A331359 (unoriented), A331360 (chiral), A331361 (achiral).

Cf. A331350 (simplex), A331354 (orthoplex), A338952 (24-cell), A338964 (120-cell, 600-cell).

Table[(48n^4 + 32n^6 + 36n^8 + 32n^12 + 19n^16 + 24n^18 + n^32)/192, {n, 1, 25}]

a(n) = (48*n^4 + 32*n^6 + 36*n^8 + 32*n^12 + 19*n^16 + 24*n^18 + n^32) / 192.
a(n) = C(n,1) + 22409618*C(n,2) + 9651132365418*C(n,3) + 96038196404417832*C(n,4) + 120785673234798359850*C(n,5) + 40725205155234194765220*C(n,6) + 5464611173328028329053040*C(n,7) + 367782713912186945387883840*C(n,8) + 14373563321596798877701789800*C(n,9) + 359883141899402124632485810800*C(n,10) + 6184991837595074128351177096800*C(n,11) + 76711443861342809436413801659200*C(n,12) + 712777405284132776184971034460800*C(n,13) + 5104524541259652946568783959507200*C(n,14) + 28797485239301310151711610238720000*C(n,15) + 130163892496470993203014850790912000*C(n,16) + 477548461917280632356433595575936000*C(n,17) + 1436223810514558840121822575516416000*C(n,18) + 3566452148795758403208660387955200000*C(n,19) + 7348050481070906467554726390758400000*C(n,20) + 12594856495384277051085880584652800000*C(n,21) + 17969280084916069147800454551859200000*C(n,22) + 21302862405912312079825436975308800000*C(n,23) + 20896529603947922315711136828211200000*C(n,24) + 16837871283345549751877122560000000000*C(n,25) + 11021533432128296153318764634112000000*C(n,26) + 5764800913106992933428143603712000000*C(n,27) + 2351280741029830331492705206272000000*C(n,28) + 720354927933711780177833164800000000*C(n,29) + 155891316152123120086047129600000000*C(n,30) + 21242333189959633945791037440000000*C(n,31) + 1370473109029653802954260480000000*C(n,32), where the coefficient of C(n,k) is the number of colorings using exactly k colors.
a(n) = A331359(n) + A331360(n) = 2*A331359(n) - A331361(n) = 2*A331360(n) + A331361(n).

A331361 Number of achiral colorings of the edges of a tesseract with n available colors.

Original entry on oeis.org

1, 93024, 294157089, 91983927296, 7960001890625, 304914963625056, 6652124939544609, 96100248309858304, 1013293206632601441, 8334166666733500000, 56066328722011832961, 319495406392484665344

Offset: 1

Robert A. Russell, Jan 14 2020

A tesseract is a regular 4-dimensional orthotope or hypercube with 16 vertices and 32 edges. Its Schläfli symbol is {4,3,3}. An achiral coloring is identical to its reflection. Also the number of achiral colorings of the triangular faces of a regular 4-dimensional orthoplex {3,3,4} with n available colors.
There are 192 elements in the automorphism group of the tesseract that are not in its rotation group. Each is associated with a partition of 4 based on the conjugacy group of the permutation of the axes. The first formula is obtained by averaging their cycle indices after replacing x_i^j with n^j according to the Pólya enumeration theorem.
  Partition  Count  Odd Cycle Indices
  4          6      8x_4^8
  31         8      4x_1^2x_3^2x_6^4 + 4x_2^1x_6^5
  22         3      8x_4^8
  211        6      2x_1^8x_2^12 + 2x_2^16 + 4x_4^8
  1111       1      4x_1^8x_2^12 + 4x_2^16

G. Royle, Partitions and Permutations
Index entries for linear recurrences with constant coefficients, signature (21, -210, 1330, -5985, 20349, -54264, 116280, -203490, 293930, -352716, 352716, -293930, 203490, -116280, 54264, -20349, 5985, -1330, 210, -21, 1).

Cf. A331358 (oriented), A331359 (unoriented), A331360 (chiral).

Cf. A331353 (simplex), A331357 (orthoplex), A338955 (24-cell), A338967 (120-cell, 600-cell).

Table[(2n^6 + 8n^8 + n^16 + n^20)/12, {n, 1, 25}]

a(n) = (2*n^6 + 8*n^8 + n^16 + n^20) / 12.
a(n) = C(n,1) + 93022*C(n,2) + 293878020*C(n,3) + 90807857080*C(n,4) + 7503022894800*C(n,5) + 258528829444320*C(n,6) + 4681671089961600*C(n,7) + 50981530073846400*C(n,8) + 363246007692204000*C(n,9) + 1789536284820648000*C(n,10) + 6323058513173001600*C(n,11) + 16406578807069651200*C(n,12) + 31689737477798400000*C(n,13) + 45786987328642560000*C(n,14) + 49291621471572480000*C(n,15) + 38970361271761920000*C(n,16) + 21972146261345280000*C(n,17) + 8363100653107200000*C(n,18) + 1926047423139840000*C(n,19) + 202741834014720000*C(n,20), where the coefficient of C(n,k) is the number of colorings using exactly k colors.
a(n) = 2*A331359(n) - A331358(n) = A331358(n) - 2*A331360(n) = A331359(n) - A331360(n).

A331352 Number of chiral pairs of colorings of the edges (or triangular faces) of a regular 4-dimensional simplex with n available colors.

Original entry on oeis.org

0, 6, 405, 7904, 76880, 486522, 2300305, 8806336, 28725192, 82626270, 214744629, 513368064, 1144198952, 2402617490, 4792612545, 9142333696, 16768783408, 29707141878, 51023629173, 85234690080, 138859666848

Offset: 1

Robert A. Russell, Jan 14 2020

A 4-dimensional simplex has 5 vertices and 10 edges. Its Schläfli symbol is {3,3,3}. The chiral colorings of its edges come in pairs, each the reflection of the other.

Index entries for linear recurrences with constant coefficients, signature (11, -55, 165, -330, 462, -462, 330, -165, 55, -11, 1).

Cf. A331350 (oriented), A063843 (unoriented), A331353 (achiral).
Other polychora: A331360 (8-cell), A331356 (16-cell), A338954 (24-cell), A338966 (120-cell, 600-cell).
Row 4 of A327085 (simplex edges and ridges) and A337885 (simplex faces and peaks).

Table[(24n^2 - 50n^3 + 20n^4 + 15n^6 - 10n^7 + n^10)/120, {n, 1, 25}]

a(n) = (24*n^2 - 50*n^3 + 20*n^4 + 15*n^6 - 10*n^7 + n^10) / 120.
a(n) = 6*C(n,2) + 387*C(n,3) + 6320*C(n,4) + 41350*C(n,5) + 135792*C(n,6) + 246540*C(n,7) + 252000*C(n,8) + 136080*C(n,9) + 30240*C(n,10), where the coefficient of C(n,k) is the number of colorings using exactly k colors.
a(n) = A331350(n) - A063843(n) = (A331350(n) - A331353(n)) / 2 = A063843(n) - A331353(n).

A337409 Array read by descending antidiagonals: T(n,k) is the number of chiral pairs of colorings of the edges of a regular n-dimensional orthotope (hypercube) using k or fewer colors.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 3, 74, 0, 0, 15, 10704, 11158298, 0, 0, 45, 345640, 4825452718593, 314824408633217132928, 0, 0, 105, 5062600, 48038354542204960, 38491882659952177472606694634030116, 136221825854745676076981182469325427379054390050209792, 0

Offset: 1

Robert A. Russell, Aug 26 2020

Each member of a chiral pair is a reflection, but not a rotation, of the other. For n=1, the figure is a line segment with one edge. For n=2, the figure is a square with 4 edges. For n=3, the figure is a cube with 12 edges. The number of edges is n*2^(n-1).

Also the number of chiral pairs of colorings of the regular (n-2)-dimensional simplexes in a regular n-dimensional orthoplex.

			Table begins with T(1,1):
0  0     0      0       0        0         0          0          0 ...
0  0     3     15      45      105       210        378        630 ...
0 74 10704 345640 5062600 45246810 288005144 1430618784 5881281480 ...
For T(2,3)=3, the chiral arrangements are AABC-AACB, ABBC-ACBB, and ABCC-ACCB.

K. Balasubramanian, Computational enumeration of colorings of hyperplanes of hypercubes for all irreducible representations and applications, J. Math. Sci. & Mod. 1 (2018), 158-180.

Cf. A337407 (oriented), A337408 (unoriented), A337410 (achiral).
Rows 2-4 are A050534, A337406, A331360.
Cf. A327085 (simplex edges), A337413 (orthoplex edges), A325014 (orthotope vertices).

m=1; (* dimension of color element, here an edge *)
Fi1[p1_] := Module[{g, h}, Coefficient[Product[g = GCD[k1, p1]; h = GCD[2 k1, p1]; (1+2x^(k1/g))^(r1[[k1]] g) If[Divisible[k1, h], 1, (1+2x^(2 k1/h))^(r2[[k1]] h/2)], {k1, Flatten[Position[cs, n1_ /; n1 > 0]]}], x, n-m]];
FiSum[] := (Do[Fi2[k2] = Fi1[k2], {k2, Divisors[per]}]; DivisorSum[per, DivisorSum[d1 = #, MoebiusMu[d1/#] Fi2[#] &]/# &]);
CCPol[r_List] := (r1 = r; r2 = cs - r1; per = LCM @@ Table[If[cs[[j2]] == r1[[j2]], If[0 == cs[[j2]],1,j2], 2j2], {j2,n}]; If[EvenQ[Sum[If[EvenQ[j3], r1[[j3]], r2[[j3]]], {j3,n}]],1,-1]Times @@ Binomial[cs, r1] 2^(n-Total[cs]) b^FiSum[]);
PartPol[p_List] := (cs = Count[p, #]&/@ Range[n]; Total[CCPol[#]&/@ Tuples[Range[0,cs]]]);
pc[p_List] := Module[{ci, mb}, mb = DeleteDuplicates[p]; ci = Count[p, #]&/@ mb; n!/(Times@@(ci!) Times@@(mb^ci))] (*partition count*)
row[n_Integer] := row[n] = Factor[(Total[(PartPol[#] pc[#])&/@ IntegerPartitions[n]])/(n! 2^n)]
array[n_, k_] := row[n] /. b -> k
Table[array[n,d+m-n], {d,7}, {n,m,d+m-1}] // Flatten

The algorithm used in the Mathematica program below assigns each permutation of the axes to a partition of n and then considers separate conjugacy classes for axis reversals. It uses the formulas in Balasubramanian's paper. If the value of m is increased, one can enumerate colorings of higher-dimensional elements beginning with T(m,1).

T(n,k) = A337407(n,k) - A337408(n,k) = (A337407(n,k) - A337410(n,k)) / 2 = A337408(n,k) - A337410(n,k).

A338954 Number of chiral pairs of colorings of the 96 edges (or triangular faces) of the 4-D 24-cell using subsets of a set of n colors.

Original entry on oeis.org

68774446614978208476646592, 5523164445430505077912054084256733211946217, 5448873034189827051926943172520863487560602391778344960, 10956401461402941741829554371669666304159415287557559324930859375

Offset: 2

Robert A. Russell, Nov 17 2020

Each member of a chiral pair is a reflection but not a rotation of the other. The Schläfli symbol of the 24-cell is {3,4,3}. It has 24 octahedral facets. It is self-dual.

Robert A. Russell, Table of n, a(n) for n = 2..30
Index entries for linear recurrences with constant coefficients, order 97.

Cf. A338952 (oriented), A338953 (unoriented), A338955 (achiral), A338958 (exactly n colors), A338950 (vertices, facets), A331352 (5-cell), A331360 (8-cell edges, 16-cell faces), A331356 (16-cell edges, 8-cell faces), A338966 (120-cell, 600-cell).

Table[(96n^8+144n^12-48n^16-64n^18-192n^20-60n^24+48n^32+32n^36-5n^48+72n^50-12n^52-12n^60+n^96)/1152,{n,2,15}]

a(n) = (96*n^8 + 144*n^12 - 48*n^16 - 64*n^18 - 192*n^20 - 60*n^24 +
48*n^32 + 32*n^36 - 5*n^48 + 72*n^50 - 12*n^52 - 12*n^60 + n^96) / 1152.
a(n) = Sum_{j=2..Min(n,96)} A338958(n) * binomial(n,j).
a(n) = A338952(n) - A338953(n) = (A338952(n) - A338955(n)) / 2 = A338953(n) - A338955(n).

A337954 Number of chiral pairs of colorings of the 16 tetrahedral facets of a hyperoctahedron or of the 16 vertices of a tesseract.

Original entry on oeis.org

0, 94, 97974, 10700090, 390081800, 7280687610, 86121007714, 730895668104, 4816861200630, 26010740238450, 119563513291420, 481192778757834, 1732132086737234, 5669991002636870, 17101193825828700, 48029634770843680

Offset: 1

Robert A. Russell, Oct 03 2020

Each member of a chiral pair is a reflection, but not a rotation, of the other. The Schläfli symbols for the tesseract and the hyperoctahedron are {4,3,3} and {3,3,4} respectively. Both figures are regular 4-D polyhedra and they are mutually dual.

Index entries for linear recurrences with constant coefficients, signature (17, -136, 680, -2380, 6188, -12376, 19448, -24310, 24310, -19448, 12376, -6188, 2380, -680, 136, -17, 1).

Cf. A337952 (oriented), A128767 (unoriented), A337955 (achiral).
Other elements: A331360 (tesseract edges, hyperoctahedron faces), A331356 (tesseract faces, hyperoctahedron edges), A234249(n+1) (tesseract facets, hyperoctahedron vertices).
Other polychora: A000389 (4-simplex facets/vertices), A338950 (24-cell), A338966 (120-cell, 600-cell).
Row 4 of A325014 (orthoplex facets, orthotope vertices).

Table[(n^16-12n^12+12n^10+43n^8-48n^6-44n^4+48n^2)/384,{n, 30}]

a(n) = (n-1) * n^2 * (n+1) * (n^12 + n^10 - 11*n^8 + n^6 + 44 n^4 - 4 n^2 - 48) / 384.
a(n) = 94*C(n,2) + 97692*C(n,3) + 10308758*C(n,4) + 337560150*C(n,5) + 5098740090*C(n,6) + 42976836210*C(n,7) + 224685801060*C(n,8) + 775389028050*C(n,9) + 1830791421900*C(n,10) + 3007909258200*C(n,11) + 3439214024400*C(n,12) + 2685727044000*C(n,13) + 1366701336000*C(n,14) + 408648240000*C(n,15) + 54486432000*C(n,16), where the coefficient of C(n,k) is the number of chiral pairs of colorings using exactly k colors.
a(n) = A337952(n) - A128767(n) = (A337952(n) - A337955(n)) / 2 = A128767(n) - A337955(n).

A337893 Array read by descending antidiagonals: T(n,k) is the number of chiral pairs of colorings of the faces of a regular n-dimensional orthoplex (cross polytope) using k or fewer colors.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 0, 66, 11158298, 0, 0, 920, 4825452718593, 314824333015938998688, 0, 0, 6350, 48038354542204960, 38491882659300767730994725249684096, 31716615393292685397985382790580028572676096, 0

Offset: 2

Robert A. Russell, Sep 28 2020

Each member of a chiral pair is a reflection, but not a rotation, of the other. For n=2, the figure is a square with one square face. For n=3, the figure is an octahedron with 8 triangular faces. For higher n, the number of triangular faces is 8*C(n,3).

Also the number of chiral pairs of colorings of the peaks of an n-dimensional orthotope (hypercube). A peak is an (n-3)-dimensional orthotope.

			Table begins with T(2,1):
 0        0             0                 0                    0 ...
 0        1            66               920                 6350 ...
 0 11158298 4825452718593 48038354542204960 60632976384183154375 ...

K. Balasubramanian, Computational enumeration of colorings of hyperplanes of hypercubes for all irreducible representations and applications, J. Math. Sci. & Mod. 1 (2018), 158-180.

Cf. A337891 (oriented), A337892 (unoriented), A337894 (achiral).
Other elements: A325006 (vertices), A337413 (edges).
Other polytopes: A337885 (simplex), A337889 (orthotope).
Rows 2-4 are A000004, A337896, A331360.

m=2; (* dimension of color element, here a face *)
Fi1[p1_] := Module[{g, h}, Coefficient[Product[g = GCD[k1, p1]; h = GCD[2 k1, p1]; (1 + 2 x^(k1/g))^(r1[[k1]] g) If[Divisible[k1, h], 1, (1+2x^(2 k1/h))^(r2[[k1]] h/2)], {k1, Flatten[Position[cs, n1_ /; n1 > 0]]}], x, m+1]];
FiSum[] := (Do[Fi2[k2] = Fi1[k2], {k2, Divisors[per]}];DivisorSum[per, DivisorSum[d1 = #, MoebiusMu[d1/#] Fi2[#] &]/# &]);
CCPol[r_List] := (r1 = r; r2 = cs - r1; per = LCM @@ Table[If[cs[[j2]] == r1[[j2]], If[0 == cs[[j2]],1,j2], 2j2], {j2,n}]; If[EvenQ[Sum[If[EvenQ[j3], r1[[j3]], r2[[j3]]], {j3,n}]],1,-1]Times @@ Binomial[cs, r1] 2^(n-Total[cs]) b^FiSum[]);
PartPol[p_List] := (cs = Count[p, #]&/@ Range[n]; Total[CCPol[#]&/@ Tuples[Range[0,cs]]]);
pc[p_List] := Module[{ci, mb}, mb = DeleteDuplicates[p]; ci = Count[p, #]&/@ mb; n!/(Times@@(ci!) Times@@(mb^ci))] (*partition count*)
row[n_Integer] := row[n] = Factor[(Total[(PartPol[#] pc[#])&/@ IntegerPartitions[n]])/(n! 2^n)]
array[n_, k_] := row[n] /. b -> k
Table[array[n,d+m-n], {d,6}, {n,m,d+m-1}] // Flatten

The algorithm used in the Mathematica program below assigns each permutation of the axes to a partition of n and then considers separate conjugacy classes for axis reversals. It uses the formulas in Balasubramanian's paper. If the value of m is increased, one can enumerate colorings of higher-dimensional elements beginning with T(m,1).

T(n,k) = A337891(n,k) - A337892(n,k) = (A337891(n,k) - A337894(n,k)) / 2 = A337892(n,k) - A337894(n,k).

cp's OEIS Frontend

A331359 Number of unoriented colorings of the edges of a tesseract with n available colors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A234249 Number of ways to choose 4 points in an n X n X n triangular grid.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A331356 Number of chiral pairs of colorings of the edges of a regular 4-dimensional orthoplex with n available colors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A331358 Number of oriented colorings of the edges of a tesseract with n available colors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A331361 Number of achiral colorings of the edges of a tesseract with n available colors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A331352 Number of chiral pairs of colorings of the edges (or triangular faces) of a regular 4-dimensional simplex with n available colors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A337409 Array read by descending antidiagonals: T(n,k) is the number of chiral pairs of colorings of the edges of a regular n-dimensional orthotope (hypercube) using k or fewer colors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A338954 Number of chiral pairs of colorings of the 96 edges (or triangular faces) of the 4-D 24-cell using subsets of a set of n colors.

Views

Author

Keywords

Comments

Links