A287239 -id:A287239 - cp's OEIS frontend

A287245 Number of inequivalent n X n matrices over GF(7) under action of dihedral group of the square D_4, with one-seventh each of 1's, 2's, 3's, 4's, 5's, 6's and 7's (ordered occurrences rounded up/down if n^2 != 0 mod 7).

1, 1, 1, 11340, 2270280240, 27055587870486000, 21628439666761521875561280, 920451958269648700957746787694592000, 1914192808178753950843058828570207003149548000000, 216425158352284448578663515683744576588775769063470820304640000

Offset: 0

María Merino, Imanol Unanue, May 22 2017

nonn

Computed using Polya's enumeration theorem for coloring.

			For n = 3 the a(3) = 11340 solutions are colorings of 3 X 3 matrices in 7 colors inequivalent under the action of D_4 with exactly occurrences 2, 2, 1, 1, 1, 1, 1 of each color (coefficient of x1^2 x2^2 x3^1 x4^1 x5^1 x6^1 x7^1).

María Merino, Table of n, a(n) for n = 0..33
M. Merino and I. Unanue, Counting squared grid patterns with Pólya Theory, EKAIA, 34 (2018), 289-316 (in Basque).

Cf. A286393, A082963, A286447, A286525, A286526, A287239.

G.f.: g(x1,x2,x3,x4,x5,x6,x7)=1/8*(y1^(n^2)+2*y1^n*y2^((n^2-n)/2)+3*y2^(n^2/2)+2*y4^(n^2/4)) if n even and 1/8*(y1^(n^2)+4*y1^n*y2^((n^2-n)/2)+y1*y2^((n^2-1)/2)+2*y1*y4^((n^2-1)/4)) if n odd, where coefficient correspond to y1=Sum_{i=1..7} x_i, y2=Sum_{i=1..7} x_i^2, y4=Sum_{i=1..7} x_i^4 and occurrences of numbers are ceiling(n^2/7) for the first k numbers and floor(n^2/7) for the last (7-k) numbers, if n^2 = k mod 7.

A287249 Number of inequivalent n X n matrices over GF(8) under action of dihedral group of the square D_4, with one-eighth each of 1's, 2's, 3's, 4's, 5's, 6's, 7's and 8's (ordered occurrences rounded up/down if n^2 != 0 mod 8).

Original entry on oeis.org

1, 1, 1, 22680, 10216251360, 288592936632000000, 675888739586283307003920000, 150403128386758194407881602780164966400, 2270715491453850844620503532869818724155487772912000, 2190916399747036514334089808617857198357442887303702763561256837120

Offset: 0

María Merino, Imanol Unanue, May 22 2017

nonn

Computed using Polya's enumeration theorem for coloring.

			For n = 3 the a(4) = 10216251360 solutions are colorings of 4 X 4 matrices in 8 colors inequivalent under the action of D_4 with exactly 2 occurrences of each color (coefficient of x1^2 x2^2 x3^2 x4^2 x5^2 x6^2 x7^2 x8^2).

María Merino, Table of n, a(n) for n = 0..32
M. Merino and I. Unanue, Counting squared grid patterns with Pólya Theory, EKAIA, 34 (2018), 289-316 (in Basque).

Cf. A286394, A082963, A286447, A286525, A286526, A287239, A287245.

G.f.: g(x1,x2,x3,x4,x5,x6,x7,x8) = (1/8)*(y1^(n^2)+2*y1^n*y2^((n^2-n)/2)+3*y2^(n^2/2)+2*y4^(n^2/4)) if n even and (1/8)*(y1^(n^2)+4*y1^n*y2^((n^2-n)/2)+y1*y2^((n^2-1)/2)+2*y1*y4^((n^2-1)/4)) if n odd, where coefficient correspond to y1=Sum_{i=1..8} x_i, y2=Sum_{i=1..8} x_i^2, y4=Sum_{i=1..8} x_i^4 and occurrences of numbers are ceiling(n^2/8) for the first k numbers and floor(n^2/8) for the last (8-k) numbers, if n^2 = k mod 8.

A287250 Number of inequivalent n X n matrices over GF(9) under action of dihedral group of the square D_4, with one-ninth each of 1's, 2's, 3's, 4's, 5's, 6's, 7's, 8's and 9's (ordered occurrences rounded up/down if n^2 != 0 mod 9).

Original entry on oeis.org

1, 1, 1, 45360, 20432427120, 1731557619792000000, 17601269260059379482191694720, 11370476506038919496334983007474778275840, 944848320304251231447932170156537415535539635814400000, 6641336088298446224006555306105706090482482272285249518936232000000000

Offset: 0

María Merino, Imanol Unanue, May 22 2017

nonn

Computed using Polya's enumeration theorem for coloring.

			For n = 3 the a(3) = 45360 solutions are colorings of 3 X 3 matrices in 9 colors inequivalent under the action of D_4 with exactly 1 occurrence of each color (coefficient of x1^1 x2^1 x3^1 x4^1 x5^1 x6^1 x7^1 x8^1 x9^1).

María Merino, Table of n, a(n) for n = 0..31
M. Merino and I. Unanue, Counting squared grid patterns with Pólya Theory, EKAIA, 34 (2018), 289-316 (in Basque).

Cf. A286396, A082963, A286447, A286525, A286526, A287239, A287245, A287249, A287261.

G.f.: g(x1,x2,x3,x4,x5,x6,x7,x8,x9) = (1/8)*(y1^(n^2)+2*y1^n*y2^((n^2-n)/2)+3*y2^(n^2/2)+2*y4^(n^2/4)) if n even and (1/8)*(y1^(n^2)+4*y1^n*y2^((n^2-n)/2)+y1*y2^((n^2-1)/2)+2*y1*y4^((n^2-1)/4)) if n odd, where coefficient correspond to y1=Sum_{i=1..9} x_i, y2=Sum_{i=1..9} x_i^2, y4=Sum_{i=1..9} x_i^4 and occurrences of numbers are ceiling(n^2/9) for the first k numbers and floor(n^2/9) for the last (9-k) numbers, if n^2 = k mod 9.

A287261 Number of inequivalent n X n matrices over an alphabet of size 10 under action of dihedral group of the square D_4, with one-tenth of 1's, 2's, 3's, 4's, 5's, 6's, 7's, 8's, 9's and 0's (ordered occurrences rounded up/down if n^2 != 0 mod 10).

Original entry on oeis.org

1, 1, 1, 1, 40864828320, 7792009289281728000, 187746872107299580970294400000, 614005731326101652800803825889630961295360, 176445174659483893854948844253232539237396497554309120000, 7090469783239448892319287907564531885316857076509137838529329991091840000

Offset: 0

María Merino, Imanol Unanue, May 22 2017

nonn

Computed using Polya's enumeration theorem for coloring.

			For n = 3 the a(4) = 40864828320 solutions are colorings of 4 X 4 matrices in 10 colors inequivalent under the action of D_4 with exactly occurrences 2, 2, 2, 2, 2, 2, 1, 1, 1, 1 of each color (coefficient of x1^2 x2^2 x3^2 x4^2 x5^2 x6^2 x7^1 x8^1 x9^1 x10^1).

María Merino, Table of n, a(n) for n = 0..29
M. Merino and I. Unanue, Counting squared grid patterns with Pólya Theory, EKAIA, 34 (2018), 289-316 (in Basque).

Cf. A286397, A082963, A286447, A286525, A286526, A287239, A287245, A287249, A287250.

G.f.: g(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10) = (1/8)*(y1^(n^2)+2*y1^n*y2^((n^2-n)/2)+3*y2^(n^2/2)+2*y4^(n^2/4)) if n even and (1/8)*(y1^(n^2)+4*y1^n*y2^((n^2-n)/2)+y1*y2^((n^2-1)/2)+2*y1*y4^((n^2-1)/4)) if n odd, where coefficient correspond to y1=Sum_{i=1..10} x_i, y2=Sum_{i=1..10} x_i^2, y4=Sum_{i=1..10} x_i^4 and occurrences of numbers are ceiling(n^2/10) for the first k numbers and floor(n^2/10) for the last (10-k) numbers, if n^2 = k mod 10.

cp's OEIS Frontend

A287245 Number of inequivalent n X n matrices over GF(7) under action of dihedral group of the square D_4, with one-seventh each of 1's, 2's, 3's, 4's, 5's, 6's and 7's (ordered occurrences rounded up/down if n^2 != 0 mod 7).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A287249 Number of inequivalent n X n matrices over GF(8) under action of dihedral group of the square D_4, with one-eighth each of 1's, 2's, 3's, 4's, 5's, 6's, 7's and 8's (ordered occurrences rounded up/down if n^2 != 0 mod 8).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A287250 Number of inequivalent n X n matrices over GF(9) under action of dihedral group of the square D_4, with one-ninth each of 1's, 2's, 3's, 4's, 5's, 6's, 7's, 8's and 9's (ordered occurrences rounded up/down if n^2 != 0 mod 9).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A287261 Number of inequivalent n X n matrices over an alphabet of size 10 under action of dihedral group of the square D_4, with one-tenth of 1's, 2's, 3's, 4's, 5's, 6's, 7's, 8's, 9's and 0's (ordered occurrences rounded up/down if n^2 != 0 mod 10).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula