Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088310
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088310 Number of n X n (0,1)-matrices with all rows distinct and all columns distinct. +0
5
1, 2, 10, 264, 33864, 19158720, 44680224960, 413586858182400, 14960200449325582080, 2109063823453947981680640, 1162864344149083760773678387200, 2520991223487759548686737154649702400, 21598422878151131130336454273775859841843200, 734233037731110118818452425552296701963294284185600 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = n! * Sum_{k=0..n} Stirling1(n, k)*binomial(2^k, n). - Vladeta Jovovic, Nov 07 2003.

a(n) = Sum(i=0..n) Sum(j=0..n) Stirling1(n, i) * Stirling1(n, j) * 2^(i*j). - Max Alekseyev, Nov 07 2003

EXAMPLE

a(2) = 10: 00/01, 00/10, 01/00, 01/10, 01/11, 10/00, 10/01, 10/11, 11/01, 11/10.

CROSSREFS

Cf. A088229, A088309.

Sequence in context: A156510 A159558 A001528 this_sequence A134473 A005154 A074056

Adjacent sequences: A088307 A088308 A088309 this_sequence A088311 A088312 A088313

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 07 2003

EXTENSIONS

Suggested by Yuval Dekel, Nov 06, 2003; a(0)-a(5) from Edwin Clark, Nov 07, 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research