Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086206
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086206 Number of n X n matrices with entries in {0,1} with no zero row and with zero main diagonal. +0
3
0, 1, 27, 2401, 759375, 887503681, 3938980639167, 67675234241018881, 4558916353692287109375, 1213972926354344043087129601 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n) = (2^(n-1)-1)^n = Sum_{k=0..n} (-1)^k*binomial(n, k)*2^((n-k)*(n-1)).

MAPLE

with(combinat): a:=n->(mul((stirling2(n, 2)), j=1..n)): seq(a(n), n=1..10); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 03 2007

CROSSREFS

Cf. A055601, A086193.

a(n) = A092477(n,n-1).

Sequence in context: A075081 A017307 A060629 this_sequence A017427 A050644 A048567

Adjacent sequences: A086203 A086204 A086205 this_sequence A086207 A086208 A086209

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 27 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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research