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.

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.

This page as a plain text file.
%I A220886 #33 May 28 2023 08:45:25
%S A220886 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,
%T A220886 720,636,468,272,133,48,16,4,1,1,5,25,95,330,1027,2780,6550,13375,
%U A220886 23700,36403,48405,55800,55800,48405,36403,23700,13375,6550,2780,1027,330,95,25,5,1
%N 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.
%C A220886 In other words, two matrices are considered equivalent if one can be obtained from the other by some sequence of interchanges of the rows.
%H A220886 Alois P. Heinz, <a href="/A220886/b220886.txt">Rows n = 0..32, flattened</a>
%e A220886 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).
%e A220886 Triangle T(n,k) begins:
%e A220886   1;
%e A220886   1, 1;
%e A220886   1, 2,  4,  2,   1;
%e A220886   1, 3,  9, 20,  27,  27,  20,   9,   3,   1;
%e A220886   1, 4, 16, 48, 133, 272, 468, 636, 720, 636, 468, 272, 133, 48, 16, 4, 1;
%e A220886   ...
%p A220886 g:= proc(n, i, j) option remember; expand(`if`(j=0, 1, `if`(i<0, 0, add(
%p A220886       g(n, i-1, j-k)*x^(i*k)*binomial(binomial(n, i)+k-1, k), k=0..j))))
%p A220886     end:
%p A220886 T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(g(n$3)):
%p A220886 seq(T(n), n=0..5);  # _Alois P. Heinz_, Feb 15 2023
%t A220886 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
%t A220886 (* Second program: *)
%t A220886 g[n_, i_, j_] := g[n, i, j] = Expand[If[j == 0, 1, If[i < 0, 0, Sum[g[n, i - 1, j - k]*x^(i*k)*Binomial[Binomial[n, i] + k - 1, k], {k, 0, j}]]]];
%t A220886 T[n_] := CoefficientList[g[n, n, n], x];
%t A220886 Table[T[n], {n, 0, 5}] // Flatten (* _Jean-François Alcover_, May 28 2023, after _Alois P. Heinz_ *)
%Y A220886 Row sums are A060690.
%Y A220886 Columns k=0-3 give: A000012, A000027, A000290 (n>=2), A203552 (n>=3).
%Y A220886 Main diagonal gives A360660.
%Y A220886 Cf. A360693.
%K A220886 nonn,tabf
%O A220886 0,5
%A A220886 _Geoffrey Critzer_, Feb 20 2013