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.

Previous Showing 11-13 of 13 results.

A188421 Number of (6*n)Xn binary arrays with rows in nonincreasing order, 6 ones in every column and no more than 3 ones in any row.

Original entry on oeis.org

1, 7, 256, 36659, 15083334, 14100262412, 25784105550034
Offset: 1

Views

Author

R. H. Hardin Mar 30 2011

Keywords

Comments

Row 6 of A188416

Examples

			All solutions for 12X2
..1..1....1..1....1..1....1..1....1..0....1..1....1..1
..1..1....1..1....1..1....1..0....1..0....1..1....1..1
..1..1....1..1....1..0....1..0....1..0....1..1....1..1
..1..1....1..1....1..0....1..0....1..0....1..1....1..0
..1..1....1..1....1..0....1..0....1..0....1..0....1..0
..1..1....1..0....1..0....1..0....1..0....1..0....1..0
..0..0....0..1....0..1....0..1....0..1....0..1....0..1
..0..0....0..0....0..1....0..1....0..1....0..1....0..1
..0..0....0..0....0..1....0..1....0..1....0..0....0..1
..0..0....0..0....0..1....0..1....0..1....0..0....0..0
..0..0....0..0....0..0....0..1....0..1....0..0....0..0
..0..0....0..0....0..0....0..0....0..1....0..0....0..0

A188422 Number of (7*n)Xn binary arrays with rows in nonincreasing order, 7 ones in every column and no more than 3 ones in any row.

Original entry on oeis.org

1, 8, 410, 101829, 87171345, 197263686098, 990154499577167
Offset: 1

Views

Author

R. H. Hardin Mar 30 2011

Keywords

Comments

Row 7 of A188416

Examples

			All solutions for 14X2
..1..1....1..1....1..1....1..1....1..1....1..1....1..0....1..1
..1..1....1..1....1..0....1..1....1..1....1..1....1..0....1..1
..1..0....1..1....1..0....1..1....1..1....1..1....1..0....1..1
..1..0....1..1....1..0....1..1....1..1....1..0....1..0....1..1
..1..0....1..1....1..0....1..1....1..1....1..0....1..0....1..0
..1..0....1..0....1..0....1..1....1..1....1..0....1..0....1..0
..1..0....1..0....1..0....1..1....1..0....1..0....1..0....1..0
..0..1....0..1....0..1....0..0....0..1....0..1....0..1....0..1
..0..1....0..1....0..1....0..0....0..0....0..1....0..1....0..1
..0..1....0..0....0..1....0..0....0..0....0..1....0..1....0..1
..0..1....0..0....0..1....0..0....0..0....0..1....0..1....0..0
..0..1....0..0....0..1....0..0....0..0....0..0....0..1....0..0
..0..0....0..0....0..1....0..0....0..0....0..0....0..1....0..0
..0..0....0..0....0..0....0..0....0..0....0..0....0..1....0..0

A188423 Number of (8*n)Xn binary arrays with rows in nonincreasing order, 8 ones in every column and no more than 3 ones in any row.

Original entry on oeis.org

1, 9, 625, 256901, 434626896, 2259540285524
Offset: 1

Views

Author

R. H. Hardin Mar 30 2011

Keywords

Comments

Row 8 of A188416

Examples

			All solutions for 16X2
..1..1....1..1....1..1....1..1....1..1....1..1....1..0....1..1....1..1
..1..1....1..1....1..1....1..1....1..0....1..1....1..0....1..1....1..1
..1..1....1..1....1..1....1..0....1..0....1..1....1..0....1..1....1..1
..1..1....1..0....1..1....1..0....1..0....1..1....1..0....1..1....1..1
..1..1....1..0....1..1....1..0....1..0....1..1....1..0....1..1....1..0
..1..1....1..0....1..0....1..0....1..0....1..1....1..0....1..1....1..0
..1..1....1..0....1..0....1..0....1..0....1..1....1..0....1..0....1..0
..1..1....1..0....1..0....1..0....1..0....1..0....1..0....1..0....1..0
..0..0....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1
..0..0....0..1....0..1....0..1....0..1....0..0....0..1....0..1....0..1
..0..0....0..1....0..1....0..1....0..1....0..0....0..1....0..0....0..1
..0..0....0..1....0..0....0..1....0..1....0..0....0..1....0..0....0..1
..0..0....0..1....0..0....0..1....0..1....0..0....0..1....0..0....0..0
..0..0....0..0....0..0....0..1....0..1....0..0....0..1....0..0....0..0
..0..0....0..0....0..0....0..0....0..1....0..0....0..1....0..0....0..0
..0..0....0..0....0..0....0..0....0..0....0..0....0..1....0..0....0..0
Previous Showing 11-13 of 13 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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