A232215 -id:A232215 - cp's OEIS frontend

A333733 Array read by antidiagonals: T(n,k) is the number of non-isomorphic n X n nonnegative integer matrices with all row and column sums equal to k up to permutations of rows and columns.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 3, 5, 5, 1, 1, 1, 1, 3, 9, 12, 7, 1, 1, 1, 1, 4, 13, 43, 31, 11, 1, 1, 1, 1, 4, 22, 106, 264, 103, 15, 1, 1, 1, 1, 5, 30, 321, 1856, 2804, 383, 22, 1, 1, 1, 1, 5, 45, 787, 12703, 65481, 44524, 1731, 30, 1, 1

Offset: 0

Andrew Howroyd, Apr 04 2020

Terms may be computed without generating each matrix by enumerating the number of matrices by column sum sequence using dynamic programming. A PARI program showing this technique for the labeled case is given in A257493. Burnside's lemma can be used to extend this method to the unlabeled case.

			Array begins:
=======================================================
n\k | 0 1  2   3     4       5         6          7
----+--------------------------------------------------
  0 | 1 1  1   1     1       1         1          1 ...
  1 | 1 1  1   1     1       1         1          1 ...
  2 | 1 1  2   2     3       3         4          4 ...
  3 | 1 1  3   5     9      13        22         30 ...
  4 | 1 1  5  12    43     106       321        787 ...
  5 | 1 1  7  31   264    1856     12703      71457 ...
  6 | 1 1 11 103  2804   65481   1217727   16925049 ...
  7 | 1 1 15 383 44524 3925518 224549073 8597641912 ...
  ...

Andrew Howroyd, Table of n, a(n) for n = 0..275 (first 23 antidiagonals)

Rows n=0..5 are A000012, A000012, A008619, A052282, A052280, A333735.
Columns k=0..5 are A000012, A000012, A000041, A232215, A232216, A333736.
Main diagonal is A333734.
Cf. A133687, A167625, A257493, A333330, A377060.

A000512 Number of equivalence classes of n X n matrices over {0,1} with rows and columns summing to 3, where equivalence is defined by row and column permutations.

Original entry on oeis.org

0, 0, 1, 1, 2, 7, 16, 51, 224, 1165, 7454, 56349, 481309, 4548786, 46829325, 519812910, 6177695783, 78190425826, 1049510787100, 14886252250208, 222442888670708, 3492326723315796, 57468395960854710, 989052970923320185, 17767732298980160822, 332572885090541084172, 6475438355244504235759, 130954580036269713385884

Offset: 1

Eric Rogoyski

Also, isomorphism classes of bicolored cubic bipartite graphs, where isomorphism cannot exchange the colors.

			n=4: every matrix with 3 1's in each row and column can be transformed by permutation of rows (or columns) into {1110,1101,1011,0111}, therefore a(4)=1. - _Michael Steyer_, Feb 20 2003

A. Burgess, P. Danziger, E. Mendelsohn, B. Stevens, Orthogonally Resolvable Cycle Decompositions, 2013; http://www.math.ryerson.ca/~andrea.burgess/OCD-submit.pdf
Goulden and Jackson, Combin. Enum., Wiley, 1983 p. 284.

Index entries for sequences related to Latin squares and rectangles

Column k=3 of A133687.
Cf. A000186, A000513, A000840, A001501, A008325, A232215.
A079815 may be an erroneous version of this, or it may have a slightly different (as yet unknown) definition. - N. J. A. Sloane, Sep 04 2010.

Definition corrected by Brendan McKay, May 28 2006
a(1)-a(12) checked by Brendan McKay, Aug 27 2010
Terms a(15) and beyond from Andrew Howroyd, Apr 01 2020

A328159 Number of n X n matrices (up to permutation of their rows and columns) with entries {0,1,2} with all row and column sums equal to 3.

Original entry on oeis.org

0, 1, 3, 7, 19, 72, 280, 1348, 7542, 48290, 348902, 2805666, 24797845, 238678891, 2482575930, 27731295522, 330955304428, 4201424981020, 56521276891669, 803122164193328, 12018137424023094, 188906053776728602, 3111632374404898304, 53597059526977558291

Offset: 1

Brendan McKay, Oct 05 2019

Also, bipartite cubic multigraphs up to color-preserving isomorphism, with no edges of multiplicity 3.

			For n=3 the a(3)=3 solutions are [2,1,0; 1,0,2; 0,2,1], [1,1,1; 2,0,1; 0,2,1] and [1,1,1; 1,1,1; 1,1,1].

a(n) = A232215(n) - A232215(n-1) for n >= 1.

a(13) corrected and terms a(14) and beyond from Andrew Howroyd, Apr 11 2020

cp's OEIS Frontend

A333733 Array read by antidiagonals: T(n,k) is the number of non-isomorphic n X n nonnegative integer matrices with all row and column sums equal to k up to permutations of rows and columns.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A000512 Number of equivalence classes of n X n matrices over {0,1} with rows and columns summing to 3, where equivalence is defined by row and column permutations.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A328159 Number of n X n matrices (up to permutation of their rows and columns) with entries {0,1,2} with all row and column sums equal to 3.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions