A331359 -id:A331359 - cp's OEIS frontend

A063843 Number of n-multigraphs on 5 nodes.

0, 1, 34, 792, 10688, 90005, 533358, 2437848, 9156288, 29522961, 84293770, 217993600, 519341472, 1154658869, 2420188694, 4821091920, 9187076352, 16837177281, 29809183410, 51172613512, 85448030080, 139159855989, 221554769150, 345523218536, 528767663040

Offset: 0

N. J. A. Sloane, Aug 25 2001

Equivalently, number of ways to color edges of complete graph on 5 nodes with n colors, under action of symmetric group S_5, of order 120, with cycle index on edges given by (1/120)*(24*x5^2 + 30*x2*x4^2 + 20*x3^3*x1 + 20*x3*x6*x1 + 15*x1^2*x2^4 + 10*x1^4*x2^3 + x1^10). Setting all x_i = n gives the sequence.
Number of vertex colorings of the Petersen graph. Marko Riedel, Mar 24 2016
Number of unoriented colorings of the 10 triangular edges or triangular faces of a pentachoron, Schläfli symbol {3,3,3}, using n or fewer colors. Also called a 5-cell or 4-simplex. - Robert A. Russell, Oct 17 2020

T. D. Noe, Table of n, a(n) for n = 0..1000
Vladeta Jovovic, Formulae for the number T(n,k) of n-multigraphs on k nodes
Marko Riedel, Vertex colorings of the Petersen graph, Math StackExchange
Index entries for linear recurrences with constant coefficients, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).

Cf. A063842. A row of A063841.
Cf. A331350 (oriented), A331352 (chiral), A331353 (achiral), A000389(n+4) (vertices and facets)
Other polychora: A331359 (8-cell), A331355 (16-cell), A338953 (24-cell), A338965 (120-cell, 600-cell).
Row 4 of A327084 (simplex edges and ridges) and A337884 (simplex faces and peaks).

f:=n-> 1/120*(24*n^2+50*n^3+20*n^4+15*n^6+10*n^7+n^10);

Table[(24n^2+50n^3+20n^4+15n^6+10n^7+n^10)/120,{n,0,30}] (* or *) LinearRecurrence[{11,-55,165,-330,462,-462,330,-165,55,-11,1},{0,1,34,792,10688,90005,533358,2437848,9156288,29522961,84293770},30] (* Harvey P. Dale, Oct 20 2012 *)

a(n)=n^2*(n^8+10*n^5+15*n^4+20*n^2+50*n+24)/120 \\ Charles R Greathouse IV, Jan 20 2012

a(n) = (1/120)*(24*n^2+50*n^3+20*n^4+15*n^6+10*n^7+n^10).
a(n+1) = (1/5!)*(n^10 + 10*n^9 + 45*n^8 + 130*n^7 + 295*n^6 + 552*n^5 + 805*n^4 + 900*n^3 + 774*n^2 + 448*n + 120).
G.f. = (1 + 23*x + 473*x^2 + 3681*x^3 + 10717*x^4 + 11221*x^5 + 3779*x^6 + 339*x^7 + 6*x^8)/(1-x)^11.  - M. F. Hasler, Jan 19 2012
a(0)=0, a(1)=1, a(2)=34, a(3)=792, a(4)=10688, a(5)=90005, a(6)=533358, a(7)=2437848, a(8)=9156288, a(9)=29522961, a(10)=84293770, a(n)= 11*a(n-1)- 55*a(n-2)+165*a(n-3)-330*a(n-4)+462*a(n-5)-462*a(n-6)+ 330*a(n-7)- 165*a(n-8)+55*a(n-9)-11*a(n-10)+a(n-11). - Harvey P. Dale, Oct 20 2012
From Robert A. Russell, Oct 17 2020: (Start)
a(n) = A331350(n) - A331352(n) = (A331350(n) + A331353(n)) / 2 = A331352(n) + A331353(n).
a(n) = 1*C(n,1) + 32*C(n,2) + 693*C(n,3) + 7720*C(n,4) + 44150*C(n,5) + 138312*C(n,6) + 247380*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 unoriented colorings using exactly k colors. (End)

More terms from Vladeta Jovovic, Sep 02 2001

A331360 Number of chiral pairs of colorings of the edges of a tesseract with n available colors.

Original entry on oeis.org

0, 11158298, 4825452718593, 48038354542204960, 60632976384183154375, 20725679827848535509690, 2876113731787568888218778, 206323339833986421110604288, 8941884948181243949620880070

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}. 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 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), A331359 (unoriented), A331361 (achiral).

Cf. A331352 (simplex), A331356 (orthoplex), A338954 (24-cell), A338966 (120-cell, 600-cell).

Table[(48n^4 - 92n^8 + 32n^12 + 3n^16 + 24n^18 - 16n^20 + n^32)/384, {n, 1, 25}]

a(n) = (48*n^4 - 92*n^8 + 32*n^12 + 3*n^16 + 24*n^18 - 16*n^20 + n^32) / 384.
a(n) = 11158298*C(n,2) + 4825419243699*C(n,3) + 48019052798280376*C(n,4) + 60392832865887732525*C(n,5) + 20362602448352682660450*C(n,6) + 2732305584323178619545720*C(n,7) + 183891356930602707657018720*C(n,8) + 7186781660616776435004792900*C(n,9) + 179941570948806294173832581400*C(n,10) + 3092495918794375534919002047600*C(n,11) + 38355721930663201428803366004000*C(n,12) + 356388702642050543223746618030400*C(n,13) + 2552262270629803579790727658473600*C(n,14) + 14398742619650630430045069333120000*C(n,15) + 65081946248235477116326789514496000*C(n,16) + 238774230958640305192143667115328000*C(n,17) + 718111905257279415879360961204608000*C(n,18) + 1783226074397879200641306482407680000*C(n,19) + 3674025240535453233675992278371840000*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) - A331359(n) = (A331358(n) - A331361(n)) / 2 = A331359(n) - A331361(n).

A331355 Number of unoriented colorings of the edges of a regular 4-dimensional orthoplex with n available colors.

Original entry on oeis.org

1, 49127, 740360358, 733776248840, 155261523065875, 12340612271439081, 498926608780739307, 12298018390569089088, 207726683413584244680, 2604177120221402303875, 25650403577338260144611, 207023317470352041578712

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}. Two unoriented colorings are the same if congruent; chiral pairs are counted as one. Also the number of unoriented 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), A331356 (chiral), A331357 (achiral).
Other polychora: A063843 (5-cell), A331359 (8-cell), A338953 (24-cell), A338965 (120-cell, 600-cell).
Row 4 of A337412 (orthoplex edges, orthotope ridges) and A337888 (orthotope faces, orthoplex peaks).

Table[(48 n^3 + 64 n^4 + 44 n^6 + 84 n^7 + 56 n^8 + 12 n^9 + 5 n^12 +
    36 n^13 + 18 n^14 + 12 n^15 + 4 n^18 + n^24)/384, {n, 1, 25}]

a(n) = (48*n^3 + 64*n^4 + 44*n^6 + 84*n^7 + 56*n^8 + 12*n^9 + 5*n^12 +
   36*n^13 + 18*n^14 + 12*n^15 + 4*n^18 + n^24) / 384.
a(n) = C(n,1) + 49125*C(n, 2) + 740212980*C(n, 3) + 730815102166*C(n, 4) + 151600044933990*C(n, 5) + 11420034970306170*C(n, 6) + 415777158607920585*C(n, 7) + 8643499341510394200*C(n, 8) + 113988734942055623055*C(n, 9) + 1023002477284840979850*C(n, 10) + 6559265715033958749900*C(n, 11) + 31097943476763200314200*C(n, 12) + 111710751446923209781200*C(n, 13) + 309231173588248964052000*C(n, 14) + 666846649590586048584000*C(n, 15) + 1126625898539640346848000*C(n, 16) + 1492173541849975272288000*C(n, 17) + 1541987122059614438208000*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) - A331356(n) = (A331354(n) + A331357(n)) / 2 = A331356(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).

A128767 Number of inequivalent n-colorings of the 4D hypercube under the full orthogonal group of the cube (of order 2^4*4! = 384).

Original entry on oeis.org

1, 402, 132102, 11756666, 405385550, 7416923886, 86986719477, 735192450952, 4834517667381, 26073250910950, 119759687845446, 481750080584202, 1733588303252702, 5673534527793146, 17109303241791825, 48047227408513056

Offset: 1

Ricardo Perez-Aguila (ricardo.perez.aguila(AT)gmail.com), Apr 04 2007

I assume this refers to colorings of the vertices of the cube. - N. J. A. Sloane, Apr 06 2007

Number of unoriented colorings of the 16 tetrahedral facets of a hyperoctahedron or of the 16 vertices of a tesseract (4-D cube) using up to n colors. Each chiral pair is counted as one when enumerating unoriented arrangements. 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. - Robert A. Russell, Oct 03 2020

			a(2)=402 because there are 402 inequivalent 2-colorings of the 4D hypercube.

Banks, D. C.; Linton, S. A. & Stockmeyer, P. K. Counting Cases in Substitope Algorithms. IEEE Transactions on Visualization and Computer Graphics, Vol. 10, No. 4, pp. 371-384. 2004.
Perez-Aguila, Ricardo. Enumerating the Configurations in the n-Dimensional Orthogonal Polytopes Through Polya's Counting and A Concise Representation. Proceedings of the 3rd International Conference on Electrical and Electronics Engineering and XII Conference on Electrical Engineering ICEEE and CIE 2006, pp. 63-66.
Polya, G. & Read R. C. Combinatorial Enumeration of Groups, Graphs and Chemical Compounds. Springer-Verlag, 1987.

Banks, D. C.; Linton, S. A. & Stockmeyer, P. K., Counting Cases in Substitope Algorithms, IEEE Transactions on Visualization and Computer Graphics, Vol. 10, No. 4, pp. 371-384. 2004.
Perez-Aguila, Ricardo, Orthogonal Polytopes: Study and Application, PhD Thesis. Universidad de las Americas, Puebla. November, 2006.
Perez-Aguila, Ricardo, Enumerating the Configurations in the n-Dimensional Orthogonal Polytopes Through Polya's Counting and A Concise Representation, Proceedings of the 3rd International Conference on Electrical and Electronics Engineering and XII Conference on Electrical Engineering ICEEE and CIE 2006, pp. 63-66.
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), A337954 (chiral), A337955 (achiral).
Other elements: A331359 (tesseract edges, hyperoctahedron faces), A331355 (tesseract faces, hyperoctahedron edges), A337957 (tesseract facets, hyperoctahedron vertices).
Other polychora: A000389(n+4) (4-simplex facets/vertices), A338949 (24-cell), A338965 (120-cell, 600-cell).
Row 4 of A325013 (orthoplex facets, orthotope vertices).

Table[(1/384)*( 48*n^2 + 180*n^4 + 48*n^6 + 83*n^8 + 12*n^10 + 12*n^12 + n^16),{n,30}]

a(n) = (1/384)*(48*n^2 + 180*n^4 + 48*n^6 + 83*n^8 + 12*n^10 + 12*n^12 + n^16)
G.f.: -x*(x +1)*(x^14 +384*x^13 +125020*x^12 +9439904*x^11 +213777216*x^10 +1821620108*x^9 +6527222787*x^8 +10098845160*x^7 +6527222787*x^6 +1821620108*x^5 +213777216*x^4 +9439904*x^3 +125020*x^2 +384*x +1) / (x -1)^17. [Colin Barker, Dec 04 2012]
From Robert A. Russell, Oct 03 2020: (Start)
a(n) = 1*C(n,1) + 400*C(n,2) + 130899*C(n,3) + 11230666*C(n,4) + 347919225*C(n,5) + 5158324560*C(n,6) + 43174480650*C(n,7) + 225086553300*C(n,8) + 775894225050*C(n,9) + 1831178115900*C(n,10) + 3008073915000*C(n,11) + 3439243962000*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 unoriented colorings using exactly k colors.
a(n) = A337952(n) - A337954(n) = (A337952(n) + A337955(n)) / 2 = A337954(n) + A337955(n).
(End)

A338953 Number of unoriented 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

1, 68774446639102959610154176, 5523164445430505961199114292414803649442426, 5448873034189827051954635848284422749083650351583379456, 10956401461402941741829572441752281718329313621842215239237500000

Offset: 1

Robert A. Russell, Nov 17 2020

Each chiral pair is counted as one when enumerating unoriented arrangements. 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 = 1..30
Index entries for linear recurrences with constant coefficients, order 97.

Cf. A338952 (oriented), A338954 (chiral), A338955 (achiral), A338957 (exactly n colors), A338949 (vertices, facets), A063843 (5-cell), A331359 (8-cell edges, 16-cell faces), A331355 (16-cell edges, 8-cell faces), A338965 (120-cell, 600-cell).

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

a(n) = (96*n^8 + 144*n^12 + 144*n^16 + 128*n^18 + 192*n^20 + 228*n^24 +
48*n^32 + 32*n^36 + 43*n^48 + 72*n^50 + 12*n^52 + 12*n^60 + n^96) / 1152.
a(n) = Sum_{j=1..Min(n,96)} A338957(n) * binomial(n,j).
a(n) = A338952(n) - A338954(n) = (A338952(n) + A338955(n)) / 2 = A338954(n) + A338955(n).

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

Original entry on oeis.org

1, 2, 1, 3, 6, 1, 4, 21, 144, 1, 5, 55, 12111, 11251322, 1, 6, 120, 358120, 4825746875682, 314824456456819827136, 1, 7, 231, 5131650, 48038446526132256, 38491882660019692002988737797054040, 136221825854745676520058554256163406987047485113810944, 1

Offset: 1

Robert A. Russell, Aug 26 2020

Each chiral pair is counted as one when enumerating unoriented arrangements. 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 unoriented colorings of the regular (n-2)-dimensional simplexes in a regular n-dimensional orthoplex.

			Table begins with T(1,1):
1   2     3      4       5        6         7          8          9 ...
1   6    21     55     120      231       406        666       1035 ...
1 144 12111 358120 5131650 45528756 288936634 1433251296 5887880415 ...
For T(2,2)=6, the arrangements are AAAA, AAAB, AABB, ABAB, ABBB, and BBBB.

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), A337409 (chiral), A337410 (achiral).
Rows 1-4 are A000027, A002817, A199406, A331359.
Cf. A327084 (simplex edges), A337412 (orthoplex edges), A325013 (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 + 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, 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}]; 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) - A337409(n,k) = (A337407(n,k) - A337410(n,k)) / 2 = A337409(n,k) + A337410(n,k).

A337957 Number of unoriented colorings of the 8 cubic facets of a tesseract or of the 8 vertices of a hyperoctahedron.

Original entry on oeis.org

1, 15, 126, 715, 3060, 10626, 31465, 82251, 194580, 424270, 864501, 1663740, 3049501, 5359095, 9078630, 14891626, 23738715, 36890001, 56031760, 83369265, 121747626, 174792640, 247073751, 344291325, 473490550, 643304376

Offset: 1

Robert A. Russell, Oct 03 2020

Each chiral pair is counted as one when enumerating unoriented arrangements. 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 (9,-36,84,-126,126,-84,36,-9,1).

Cf. A337956 (oriented), A234249(n+1) (chiral), A337958 (achiral).
Other elements: A331355 (hyperoctahedron edges, tesseract faces), A331359 (hyperoctahedron faces, tesseract edges), A128767 (hyperoctahedron facets, tesseract vertices).
Other polychora: A000389(n+4) (5-cell), A338949 (24-cell), A338965 (120-cell, 600-cell).
Row 4 of A325005 (orthotope facets, orthoplex vertices).

Table[Binomial[Binomial[n+1,2]+3,4],{n,30}]

a(n) = binomial(binomial(n+1,2)+3,4).
a(n) = n * (n+1) * (n^2 + n + 2) * (n^2 + n + 4) * (n^2 + n + 6) / 384.
a(n) = 1*C(n,1) + 13*C(n,2) + 84*C(n,3) + 297*C(n,4) + 600*C(n,5) + 690*C(n,6) + 420*C(n,7) + 105*C(n,8), where the coefficient of C(n,k) is the number of unoriented colorings using exactly k colors.
a(n) = A337956(n) - A234249(n+1) = (A337956(n) + A337958(n)) / 2 = A234249(n+1) + A337958(n).
From Stefano Spezia, Oct 04 2020: (Start)
G.f.: x*(1 + 6*x + 27*x^2 + 37*x^3 + 27*x^4 + 6*x^5 + x^6)/(1 - x)^9.
a(n) = 9*a(n-1)-36*a(n-2)+84*a(n-3)-126*a(n-4)+126*a(n-5)-84*a(n-6)+36*a(n-7)-9*a(n-8)+a(n-8) for n > 8.
(End)

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

Original entry on oeis.org

1, 2, 1, 3, 22, 1, 4, 267, 11251322, 1, 5, 1996, 4825746875682, 314824532572147370464, 1, 6, 10375, 48038446526132256, 38491882660671134164965704408524083, 31716615393638864931753532641338560302264320, 1

Offset: 2

Robert A. Russell, Sep 28 2020

Each chiral pair is counted as one when enumerating unoriented arrangements. 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 unoriented colorings of the peaks of an n-dimensional orthotope (hypercube). A peak is an (n-3)-dimensional orthotope.

			Array begins with T(2,1):
 1        2             3                 4                    5 ...
 1       22           267              1996                10375 ...
 1 11251322 4825746875682 48038446526132256 60632984344185045000 ...

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), A337893 (chiral), A337894 (achiral).
Other elements: A325005 (vertices), A337412 (edges).
Other polytopes: A337884 (simplex), A337888 (orthotope).
Rows 2-4 are A000027, A128766, A331359

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}]; 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[m]=b;
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) - A337893(n,k) = (A337891(n,k) + A337894(n,k)) / 2 = A337893(n,k) + A337894(n,k).

cp's OEIS Frontend

A063843 Number of n-multigraphs on 5 nodes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A331360 Number of chiral pairs of colorings of the edges of a tesseract with n available colors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A331355 Number of unoriented 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

A128767 Number of inequivalent n-colorings of the 4D hypercube under the full orthogonal group of the cube (of order 2^4*4! = 384).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A338953 Number of unoriented 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

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords