cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A191874 Number of n X n (0,1) matrices that achieve the record mentioned in A191873.

Original entry on oeis.org

1, 1, 1, 8, 405, 2520, 4320, 32781000, 256556160, 10590199200, 2225341641600, 28746722188800
Offset: 1

Views

Author

R. H. Hardin and N. J. A. Sloane, Jun 18 2011

Keywords

Comments

Also, number of directed graphs on n labeled nodes that do not contain a subgraph isomorphic to the complete directed bipartite graph K_{2,2} and have largest number of edges (=A191873(n)). - Max Alekseyev, Feb 07 2022

Crossrefs

Cf. A191873.

Extensions

a(8)-a(12) from Max Alekseyev, Feb 07 2022