The OEIS is supported by the many generous donors to the OEIS Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125587 Call an n X n matrix robust if the top left i X i submatrix is invertible for all i = 1..n. Sequence gives number of n X n robust real {0,1}-matrices. 8
1, 4, 68, 5008, 1603232, 2224232640 (list; graph; refs; listen; history; text; internal format)
An upper bound is the total number of {0,1}-matrices, 2^(n^2).
Comment from Michael Kleber, Jan 05 2006: A lower bound is 2^(n^2-n), A053763. For given the principal n-1 X n-1 submatrix A, the 2n-2 further entries (excluding the bottom right corner) can be filled in arbitrarily and then there is always at least one choice for the last entry which makes the matrix invertible.
Comment from N. J. A. Sloane, Jan 06 2006: Let the matrix be [A b; c d], where A is n-1 X n-1, b is n-1 X 1, c is 1 X n-1, d is 0 or 1. The matrix is singular iff d = c A^(-1) b, which for given A, b, c has at most one solution d.
Suppose A = identity, as in A125586. Then if d=0 there are 3^(n-1) choices for b and c, while if d=1 there are (n-1)*3^(n-2) choices for b and c. This proves the formula in A125586.
a(2) = 4 from:
10 10 11 11
01 11 01 10
Sequence in context: A012484 A174809 A363427 * A134794 A248027 A093852
a(5) and a(6) from Brendan McKay, Jan 06 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 06:02 EST 2023. Contains 367685 sequences. (Running on oeis4.)