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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086699 Number of n X n matrices over GF(2) with rank n-1. 1
1, 9, 294, 37800, 19373760, 39687459840, 325139829719040, 10654345790226432000, 1396491759480328106803200, 732164571206732295657278668800, 1535460761275478347250381697633484800 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..11.

FORMULA

for n>=2 : a(n) = product j=0...n-2 (2^n - 2^j)^2 / (2^(n-1)- 2^j).

CROSSREFS

Cf. A002884, A060867.

Sequence in context: A118893 A055792 A053935 * A027834 A175823 A129934

Adjacent sequences:  A086696 A086697 A086698 * A086700 A086701 A086702

KEYWORD

nonn

AUTHOR

Yuval Dekel (dekelyuval(AT)hotmail.com), Jul 28 2003

EXTENSIONS

More terms from David Wasserman, Mar 28 2005

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 24 15:00 EST 2014. Contains 249899 sequences.