cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-9 of 9 results.

A327086 Array read by descending antidiagonals: A(n,k) is the number of achiral colorings of the edges of a regular n-dimensional simplex using up to k colors.

Original entry on oeis.org

1, 2, 1, 3, 4, 1, 4, 9, 10, 1, 5, 16, 45, 28, 1, 6, 25, 136, 387, 128, 1, 7, 36, 325, 2784, 8352, 792, 1, 8, 49, 666, 13125, 186304, 382563, 7620, 1, 9, 64, 1225, 46836, 2117750, 36507008, 44526672, 124344
Offset: 1

Views

Author

Robert A. Russell, Aug 19 2019

Keywords

Comments

An n-dimensional simplex has n+1 vertices and (n+1)*n/2 edges. For n=1, the figure is a line segment with one edge. For n-2, the figure is a triangle with three edges. For n=3, the figure is a tetrahedron with six edges. The Schläfli symbol, {3,...,3}, of the regular n-dimensional simplex consists of n-1 threes. An achiral coloring is identical to its reflection.
A(n,k) is also the number of achiral colorings of (n-2)-dimensional regular simplices in an n-dimensional simplex using up to k colors. Thus, A(2,k) is also the number of achiral colorings of the vertices (0-dimensional simplices) of an equilateral triangle.

Examples

			Array begins with A(1,1):
  1  2   3    4     5     6      7      8      9      10      11      12 ...
  1  4   9   16    25    36     49     64     81     100     121     144 ...
  1 10  45  136   325   666   1225   2080   3321    5050    7381   10440 ...
  1 28 387 2784 13125 46836 137543 349952 797769 1667500 3248971 5973408 ...
  ...
For A(2,3) = 9, the colorings are AAA, AAB, AAC, ABB, ACC, BBB, BBC, BCC, and CCC.
		

Crossrefs

Cf. A327083 (oriented), A327084 (unoriented), A327085 (chiral), A327090 (exactly k colors), A325001 (vertices, facets), A337886 (faces, peaks), A337410 (orthotope edges, orthoplex ridges), A337414 (orthoplex edges, orthotope ridges).
Rows 1-4 are A000027, A000290, A037270, A331353.

Programs

  • Mathematica
    CycleX[{2}] = {{1,1}}; (* cycle index for permutation with given cycle structure *)
    CycleX[{n_Integer}] := CycleX[n] = If[EvenQ[n], {{n/2,1}, {n,(n-2)/2}}, {{n,(n-1)/2}}]
    compress[x : {{, } ...}] := (s = Sort[x]; For[i = Length[s], i > 1, i -= 1, If[s[[i,1]] == s[[i-1,1]], s[[i-1,2]] += s[[i,2]]; s = Delete[s,i], Null]]; s)
    CycleX[p_List] := CycleX[p] = compress[Join[CycleX[Drop[p, -1]], If[Last[p] > 1, CycleX[{Last[p]}], ## &[]], If[# == Last[p], {#, Last[p]}, {LCM[#, Last[p]], GCD[#, Last[p]]}] & /@ Drop[p, -1]]]
    pc[p_List] := Module[{ci, mb}, mb = DeleteDuplicates[p]; ci = Count[p, #] & /@ mb; Total[p]!/(Times @@ (ci!) Times @@ (mb^ci))] (* partition count *)
    row[n_Integer] := row[n] = Factor[Total[If[EvenQ[Total[1-Mod[#,2]]], 0, pc[#] j^Total[CycleX[#]][[2]]] & /@ IntegerPartitions[n+1]]/((n+1)!/2)]
    array[n_, k_] := row[n] /. j -> k
    Table[array[n,d-n+1], {d,1,10}, {n,1,d}] // Flatten
    (* Using Fripertinger's exponent per Andrew Howroyd's code in A063841: *)
    pc[p_] := Module[{ci, mb}, mb = DeleteDuplicates[p]; ci = Count[p, #] &/@ mb; Total[p]!/(Times @@ (ci!) Times @@ (mb^ci))]
    ex[v_] := Sum[GCD[v[[i]], v[[j]]], {i,2,Length[v]}, {j,i-1}] + Total[Quotient[v,2]]
    array[n_,k_] := Total[If[OddQ[Total[1-Mod[#,2]]], pc[#]k^ex[#], 0] &/@ IntegerPartitions[n+1]]/((n+1)!/2)
    Table[array[n,d-n+1], {d,10}, {n,d}] // Flatten

Formula

The algorithm used in the Mathematica program below assigns each permutation of the vertices to a partition of n+1. It then determines the number of permutations for each partition and the cycle index for each partition.
A(n,k) = Sum_{j=1..(n+1)*n/2} A327090(n,j) * binomial(k,j).
A(n,k) = 2*A327084(n,k) - A327083(n,k) = A327083(n,k) - 2*A327085(n,k) = A327084(n,k) - A327085(n,k).

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

Original entry on oeis.org

1, 8200, 9080559, 1503323520, 81461669375, 2146080958056, 34228350856910, 377534786525184, 3140004522270465, 20896479183085000, 116094911796177061, 555622588428635520, 2346039511676401359, 8903083257215729960
Offset: 1

Views

Author

Robert A. Russell, Jan 14 2020

Keywords

Comments

A regular 4-dimensional orthoplex (also hyperoctahedron or cross polytope) has 8 vertices and 24 edges. Its Schläfli symbol is {3,3,4}. An achiral coloring is identical to its reflection. Also the number of achiral colorings of the square faces of a tesseract {4,3,3} with n available colors.
There are 192 elements in the automorphism group of the 4-dimensional orthoplex 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_2^2x_4^5
31 8 4x_3^4x_6^2 + 4x_6^4
22 3 8x_1^2x_2^1x_4^5
211 6 2x_1^2x_2^11 + 2x_1^6x_2^9 + 4x_2^2x_4^5
1111 1 4x_1^12x_2^6 + 4x_2^12

Crossrefs

Cf. A331354 (oriented), A331355 (unoriented), A331356 (chiral).
Other polychora: A331353 (5-cell), A331361 (8-cell), A338955 (24-cell), A338967 (120-cell, 600-cell).
Row 4 of A337414 (orthoplex edges, orthotope ridges) and A337890 (orthotope faces, orthoplex peaks).

Programs

  • Mathematica
    Table[(8n^4 + 8n^6 + 18n^7 + 6n^8 + n^12 + 3n^13 + 3n^15 + n^18)/48, {n, 1, 25}]

Formula

a(n) = (8*n^4 + 8*n^6 + 18*n^7 + 6*n^8 + n^12 + 3*n^13 + 3*n^15 + n^18) / 48.
a(n) = C(n,1) + 8198*C(n,2) + 9055962*C(n,3) + 1467050480*C(n,4) + 74035775370*C(n,5) + 1679679306420*C(n,6) + 20864180531565*C(n,7) + 159341117375160*C(n,8) + 804216787965360*C(n,9) + 2808560520334800*C(n,10) + 6981656802951600*C(n,11) + 12540346820971200*C(n,12) + 16328843044113600*C(n,13) + 15272715797539200*C(n,14) + 10003790644848000*C(n,15) + 4357170994176000*C(n,16) + 1133753677056000*C(n,17) + 133382785536000*C(n,18), where the coefficient of C(n,k) is the number of colorings using exactly k colors.
a(n) = 2*A331355(n) - A331354(n) = A331354(n) - 2*A331356(n) = A331355(n) - A331356(n).

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

Original entry on oeis.org

1, 2, 1, 3, 6, 1, 4, 24, 218, 1, 5, 70, 2285, 90054, 1, 6, 165, 703760, 1471640157, 573439556, 1, 7, 336, 10194250, 1466049174160, 6332134720430727, 50043770249328, 1, 8, 616, 90775566, 310441584462375, 629648890639384572032, 1839894096099964270283469, 59966884221697869216, 1
Offset: 1

Views

Author

Robert A. Russell, Aug 26 2020

Keywords

Comments

Each chiral pair is counted as two when enumerating oriented 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 an octahedron with 12 edges. The number of edges is 2n*(n-1) for n>1.
Also the number of oriented colorings of the regular (n-2)-dimensional orthotopes (hypercubes) in a regular n-dimensional orthotope.

Examples

			Table begins with T(1,1):
1   2     3      4        5        6         7          8           9 ...
1   6    24     70      165      336       616       1044        1665 ...
1 218 22815 703760 10194250 90775566 576941778 2863870080 11769161895 ...
For T(2,2)=6, the arrangements are AAAA, AAAB, AABB, ABAB, ABBB, and BBBB.
		

Crossrefs

Cf. A337412 (unoriented), A337413 (chiral), A337414 (achiral).
Rows 1-4 are A000027, A006528, A060530, A331354.
Cf. A327083 (simplex edges), A337407 (orthotope edges), A325004 (orthoplex vertices).

Programs

  • Mathematica
    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, 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; If[EvenQ[Sum[If[EvenQ[j3], r1[[j3]], r2[[j3]]], {j3,n}]], (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[]),0]);
    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-1))]
    array[n_, k_] := row[n] /. b -> k
    Table[array[n,d+m-n], {d,8}, {n,m,d+m-1}] // Flatten

Formula

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) = A337412(n,k) + A337413(n,k) = 2*A337412(n,k) - A337414(n,k) = 2*A337413(n,k) + A337414(n,k).

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

Original entry on oeis.org

1, 2, 1, 3, 6, 1, 4, 21, 144, 1, 5, 55, 12111, 49127, 1, 6, 120, 358120, 740360358, 293122232, 1, 7, 231, 5131650, 733776248840, 3168520600399659, 25174334733080, 1, 8, 406, 45528756, 155261523065875, 314848558732420555904, 920040738175691418086226, 30035285091978202824, 1
Offset: 1

Views

Author

Robert A. Russell, Aug 26 2020

Keywords

Comments

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 an octahedron with 12 edges. The number of edges is 2n*(n-1) for n>1.
Also the number of unoriented colorings of the regular (n-2)-dimensional orthotopes (hypercubes) in a regular n-dimensional orthotope.

Examples

			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.
		

Crossrefs

Cf. A337411 (oriented), A337413 (chiral), A337414 (achiral).
Rows 1-4 are A000027, A002817, A199406, A331355.
Cf. A327084 (simplex edges), A337408 (orthotope edges), A325005 (orthoplex vertices).

Programs

  • Mathematica
    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, 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,8}, {n,m,d+m-1}] // Flatten

Formula

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) = A337411(n,k) - A337413(n,k) = (A337411(n,k) + A337414(n,k)) / 2 = A337413(n,k) + A337414(n,k).

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

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 3, 74, 0, 0, 15, 10704, 40927, 0, 0, 45, 345640, 731279799, 280317324, 0, 0, 105, 5062600, 732272925320, 3163614120031068, 24869435516248, 0, 0, 210, 45246810, 155180061396500, 314800331906964016128, 919853357924272852197243, 29931599129719666392, 0
Offset: 1

Views

Author

Robert A. Russell, Aug 26 2020

Keywords

Comments

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 an octahedron with 12 edges. The number of edges is 2n*(n-1) for n>1.
Also the number of chiral pairs of colorings of the regular (n-2)-dimensional orthotopes (hypercubes) in a regular n-dimensional orthotope.

Examples

			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.
		

Crossrefs

Cf. A337411 (oriented), A337412 (unoriented), A337414 (achiral).
Rows 2-4 are A050534, A337406, A331356.
Cf. A327085 (simplex edges), A337409 (orthotope edges), A325006 (orthoplex vertices).

Programs

  • Mathematica
    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, 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,8}, {n,m,d+m-1}] // Flatten

Formula

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) = A337411(n,k) - A337412(n,k) = (A337411(n,k) - A337414(n,k)) / 2 = A337412(n,k) - A337414(n,k).

A331351 Number of achiral colorings of the edges of a cube or regular octahedron.

Original entry on oeis.org

1, 70, 1407, 12480, 69050, 281946, 931490, 2632512, 6598935, 15041950, 31740841, 62830560, 117855192, 211141490, 363551700, 604679936, 975561405, 1531968822, 2348375395, 3522668800, 5181705606, 7487800650, 10646250902
Offset: 1

Views

Author

Robert A. Russell, Jan 14 2020

Keywords

Comments

A cube has 8 vertices and 12 edges. A regular octahedron has 6 vertices and 12 edges. An achiral coloring is identical to its reflection.
From Robert A. Russell, Oct 08 2020: (Start)
The Schläfli symbols for the cube and regular octahedron are {4,3} and {3,4} respectively. They are mutually dual.
There are 24 elements in the automorphism group of the regular octahedron/cube that are not in the rotation group. They divide into five conjugacy classes. The first formula is obtained by averaging the edge cycle indices after replacing x_i^j with n^j according to the Pólya enumeration theorem.
Conjugacy Class Count Odd Cycle Indices
Inversion 1 x_2^6
Vertex rotation* 8 x_6^2 Asterisk indicates that the
Edge rotation* 6 x_1^2x_2^5 operation is followed by an
Small face rotation* 3 x_4^3 inversion.
Large face rotation* 6 x_1^4x_2^4 (End)

Crossrefs

Cf. A060530 (oriented), A199406 (unoriented), A337406 (chiral), A337897 (octahedron faces, cube vertices), A337898 (cube faces, octahedron vertices), A037270 (tetrahedron), A337953 (dodecahedron, icosahedron).
Row 3 of A337410 (orthotope edges, orthoplex ridges) and A337414 (orthoplex edges, orthotope ridges).

Programs

  • Mathematica
    Table[(8n^2 + 6n^3 + n^6 + 6n^7 + 3n^8)/24, {n, 1, 30}]
    LinearRecurrence[{9, -36, 84, -126, 126, -84, 36, -9, 1}, {1, 70, 1407, 12480, 69050, 281946, 931490, 2632512, 6598935}, 25]

Formula

a(n) = (8*n^2 + 6*n^3 + n^6 + 6*n^7 + 3*n^8) / 24.
a(n) = 1*C(n,1) + 68*C(n,2) + 1200*C(n,3) + 7268*C(n,4) + 20025*C(n,5) + 27750*C(n,6) + 18900*C(n,7) + 5040*C(n,8), where the coefficient of C(n,k) is the number of colorings using exactly k colors.
a(n) = 2*A199406(n) - A060530(n) = A060530(n) - 2*A337406(n) = A199406(n) - A337406(n). - Robert A. Russell, Oct 08 2020
G.f.: (x + 61*x^2 + 813*x^3 + 2253*x^4 + 1628*x^5 + 282*x^6 + 2*x^7) / (1-x)^9.
E.g.f.: (1/24)*exp(x)*x*(24 + 816*x + 4800*x^2 + 7268*x^3 + 4005*x^4 + 925*x^5 + 90*x^6 + 3*x^7). - Stefano Spezia, Jan 17 2020

A337410 Array read by descending antidiagonals: T(n,k) is the number of achiral 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, 18, 70, 1, 5, 40, 1407, 93024, 1, 6, 75, 12480, 294157089, 47823602694208, 1, 7, 126, 69050, 91983927296, 67514530382043163023924, 443077371786837979607993095063601152, 1
Offset: 1

Views

Author

Robert A. Russell, Aug 26 2020

Keywords

Comments

An achiral arrangement is identical to its reflection. 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 achiral colorings of the regular (n-2)-dimensional simplexes in a regular n-dimensional orthoplex.

Examples

			Table begins with T(1,1):
1  2    3     4     5      6      7       8       9       10 ...
1  6   18    40    75    126    196     288     405      550 ...
1 70 1407 12480 69050 281946 931490 2632512 6598935 15041950 ...
For T(2,2)=6, the arrangements are AAAA, AAAB, AABB, ABAB, ABBB, and BBBB.
		

Crossrefs

Cf. A337407 (oriented), A337408 (unoriented), A337409 (chiral).
Rows 1-4 are A000027, A002411, A331351, A331361.
Cf. A327086 (simplex edges), A337414 (orthoplex edges), A325015 (orthotope vertices).

Programs

  • Mathematica
    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; If[EvenQ[Sum[If[EvenQ[j3], r1[[j3]], r2[[j3]]], {j3,n}]],0,(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-1))]
    array[n_, k_] := row[n] /. b -> k
    Table[array[n,d+m-n], {d,7}, {n,m,d+m-1}] // Flatten

Formula

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) = 2*A337408(n,k) - A337407(n,k) = A337407(n,k) - 2*A337409(n,k) = A337408(n,k) - A337409(n,k).

A337894 Array read by descending antidiagonals: T(n,k) is the number of achiral 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, 21, 1, 4, 201, 93024, 1, 5, 1076, 294157089, 199556208371776, 1, 6, 4025, 91983927296, 1370366433970979158839987, 346179533768149850758531729588224, 1
Offset: 2

Views

Author

Robert A. Russell, Sep 28 2020

Keywords

Comments

An achiral arrangement is identical to its reflection. 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 achiral colorings of the peaks of an n-dimensional orthotope (hypercube). A peak is an (n-3)-dimensional orthotope.

Examples

			Table begins with T(2,1):
1     2         3           4             5               6 ...
1    21       201        1076          4025           11901 ...
1 93024 294157089 91983927296 7960001890625 304914963625056 ...
		

Crossrefs

Cf. A337891 (oriented), A337892 (unoriented), A337893 (chiral).
Other elements: A325007 (vertices), A337414 (edges).
Other polytopes: A337886 (simplex), A337890 (orthotope).
Rows 2-4 are A000027, A337897, A331361.

Programs

  • Mathematica
    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; If[EvenQ[Sum[If[EvenQ[j3], r1[[j3]], r2[[j3]]], {j3,n}]],0,(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-1))]
    array[n_, k_] := row[n] /. b -> k
    Table[array[n,d+m-n], {d,7}, {n,m,d+m-1}] // Flatten

Formula

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) = 2*A337892(n,k) - A337891(n,k) = A337891(n,k) - 2*A337893(n,k) = A337892(n,k) - A337893(n,k).

A338149 Triangle read by rows: T(n,k) is the number of achiral colorings of the edges of a regular n-D orthoplex (or ridges of a regular n-D orthotope) using exactly k colors. Row 1 has 1 column; row n>1 has 2*n*(n-1) columns.

Original entry on oeis.org

1, 1, 4, 3, 0, 1, 68, 1200, 7268, 20025, 27750, 18900, 5040, 0, 0, 0, 0, 1, 8198, 9055962, 1467050480, 74035775370, 1679679306420, 20864180531565, 159341117375160, 804216787965360, 2808560520334800, 6981656802951600
Offset: 1

Views

Author

Robert A. Russell, Oct 12 2020

Keywords

Comments

An achiral coloring is identical to its reflection. A ridge is an (n-2)-face of an n-D polytope. For n=1, the figure is a line segment with one edge. For n=2, the figure is a square with 4 edges (vertices). For n=3, the figure is an octahedron (cube) with 12 edges. For n>1, the number of edges (ridges) is 2*n*(n-1). The Schläfli symbols for the n-D orthotope (hypercube) and the n-D orthoplex (hyperoctahedron, cross polytope) are {4,3,...,3,3} and {3,3,...,3,4} respectively, with n-2 3's in each case. The figures are mutually dual.
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).

Examples

			Triangle begins with T(1,1):
  1
  1    4       3          0
  1   68    1200       7268       20025         27750 18900 5040 0 0 0 0
  1 8198 9055962 1467050480 74035775370 1679679306420 ...
  ...
For T(2,2)=4, the achiral colorings are AAAB, AABB, ABAB, and ABBB. For T(2,3)=3, the 3 achiral colorings are ABAC, ABCB, and ACBC.
		

Crossrefs

Cf. A338146 (oriented), A338147 (unoriented), A338148 (chiral), A337414 (k or fewer colors), A325011 (orthoplex vertices, orthotope facets).
Cf. A327090 (simplex), A338145 (orthotope edges, orthoplex ridges).

Programs

  • Mathematica
    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, 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; If[EvenQ[Sum[If[EvenQ[j3], r1[[j3]], r2[[j3]]], {j3, n}]], 0, (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-1))]
    array[n_, k_] := row[n] /. b -> k
    Join[{{1}},Table[LinearSolve[Table[Binomial[i,j],{i,2^(m+1)Binomial[n,m+1]},{j,2^(m+1)Binomial[n,m+1]}], Table[array[n,k],{k,2^(m+1)Binomial[n,m+1]}]], {n,m+1,m+4}]] // Flatten

Formula

For n>1, A337414(n,k) = Sum_{j=1..2*n*(n-1)} T(n,j) * binomial(k,j).
T(n,k) = 2*A338147(n,k) - A338146(n,k) = A338146(n,k) - 2*A338148(n,k) = A338147(n,k) - A338148(n,k).
T(2,k) = A338145(2,k) = A325019(2,k) = A325011(2,k); T(3,k) = A338145(3,k).
Showing 1-9 of 9 results.