login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094223 Number of binary n X n matrices with all rows (columns) distinct, up to permutation of columns (rows). 13
1, 2, 7, 68, 2251, 247016, 89254228, 108168781424, 451141297789858, 6625037125817801312, 348562672319990399962384, 66545827618461283102105245248, 46543235997095840080425299916917968 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

G. Kilibarda and V. Jovovic, "Enumeration of some classes of T_0-hypergraphs", in preparation, 2004.

LINKS

Table of n, a(n) for n=0..12.

FORMULA

a(n) = Sum((-1)^(n-k)*Stirling1(n, k)*binomial(2^k, n), k=0..n) = Sum(Stirling1(n, k)*binomial(2^k+n-1, n), k=0..n).

MATHEMATICA

a[n_] := Sum[(-1)^(n - k)*StirlingS1[n, k]*Binomial[2^k, n], {k, 0, n}]; (* or *) a[n_] := Sum[ StirlingS1[n, k]*Binomial[2^k + n - 1, n], {k, 0, n}]; Table[ a[n], {n, 0, 12}] (* Robert G. Wilson v, May 29 2004 *)

CROSSREFS

Main diagonal of A059584 and A059587, A060690, A088309.

Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763

Sequence in context: A260968 A322223 A173226 * A217069 A319640 A260566

Adjacent sequences:  A094220 A094221 A094222 * A094224 A094225 A094226

KEYWORD

easy,nonn

AUTHOR

Goran Kilibarda, Vladeta Jovovic, May 28 2004

EXTENSIONS

More terms from Robert G. Wilson v, May 29 2004

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 23:15 EST 2019. Contains 319251 sequences. (Running on oeis4.)