The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A220886 Irregular triangular array read by rows: T(n,k) is the number of inequivalent n X n {0,1} matrices modulo permutation of the rows, containing exactly k 1's; n>=0, 0<=k<=n^2. 1
 1, 1, 1, 1, 2, 4, 2, 1, 1, 3, 9, 20, 27, 27, 20, 9, 3, 1, 1, 4, 16, 48, 133, 272, 468, 636, 720, 636, 468, 272, 133, 48, 16, 4, 1, 1, 5, 25, 95, 330, 1027, 2780, 6550, 13375, 23700, 36403, 48405, 55800, 55800, 48405, 36403, 23700, 13375, 6550, 2780, 1027, 330, 95, 25, 5, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS In other words, two matrices are considered equivalent if one can be obtained from the other by some sequence of interchanges of the rows. Row sums = A060690. LINKS EXAMPLE 1, 1, 1, 1, 2, 4, 2, 1, 1, 3, 9, 20, 27, 27, 20, 9, 3, 1, 1, 4, 16, 48, 133, 272, 468, 636, 720, 636, 468, 272, 133, 48, 16, 4, 1 T(2,2)=4 because we have: {{0,0},{1,1}}; {{0,1},{1,0}}; {{0,1},{0,1}}; {{1,0},{1,0}}   (where the first two matrices were arbitrarily selected as class representatives). MATHEMATICA nn=100; Table[CoefficientList[Series[CycleIndex[SymmetricGroup[n], s]/.Table[s[i]->(1+x^i)^n, {i, 1, n}], {x, 0, nn}], x], {n, 0, 5}]//Grid CROSSREFS Cf. A060690. Sequence in context: A059317 A322046 A247644 * A256156 A342060 A302828 Adjacent sequences:  A220883 A220884 A220885 * A220887 A220888 A220889 KEYWORD nonn,tabf AUTHOR Geoffrey Critzer, Feb 20 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 29 04:04 EST 2021. Contains 349416 sequences. (Running on oeis4.)