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.

Showing 1-8 of 8 results.

A221287 Equals two maps: number of n X n binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 n X n array.

Original entry on oeis.org

1, 4, 92, 9107, 4983598, 10344276279
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Diagonal of A221290

Examples

			Some solutions for n=3
..0..0..0....0..0..1....0..1..0....0..0..0....0..0..1....0..1..1....0..0..1
..1..1..0....1..0..1....0..1..0....1..0..1....0..1..0....0..1..1....1..0..1
..1..1..0....1..1..0....1..1..0....1..0..0....1..1..0....0..1..0....1..0..0
		

A221288 Equals two maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 nX5 array.

Original entry on oeis.org

7, 200, 5912, 172904, 4983598, 143511784, 4129628435, 118813480496, 3418203388701, 98338490101681, 2829094038032543, 81389941488977962, 2341498869979723606, 67362334665049967042, 1937939871911867309221
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Column 5 of A221290

Examples

			Some solutions for n=3
..0..1..1..0..1....0..0..0..0..0....0..0..0..0..0....0..0..0..1..0
..1..0..0..1..1....0..0..0..0..0....0..0..0..0..1....1..1..1..1..1
..0..0..0..1..0....1..0..1..0..0....1..1..1..1..0....0..0..1..0..0
		

A221289 Equals two maps: number of nX6 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 nX6 array.

Original entry on oeis.org

12, 792, 48298, 2890017, 172905144, 10344276279, 618825190371, 37018574118868, 2214457259485909, 132469006243923162, 7924304243009714341, 474032340904538992523, 28356641623302251544461
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Column 6 of A221290

Examples

			Some solutions for n=3
..0..0..0..1..0..0....0..0..0..0..1..1....0..0..0..1..0..0....0..0..1..0..0..1
..1..1..0..0..1..0....1..0..0..0..0..0....0..0..1..1..0..1....1..0..1..0..1..0
..0..0..1..1..0..0....1..1..1..0..1..0....1..0..1..0..1..0....1..0..1..1..0..0
		

A221291 Equals two maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 3Xn array.

Original entry on oeis.org

1, 12, 92, 673, 5912, 48298, 396846, 3240527, 26241353, 211785583, 1703772887, 13679840407, 109689414233, 878752161168, 7035829547262, 56311795445487
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Row 3 of A221290

Examples

			Some solutions for n=3
..0..1..1....0..0..0....0..0..0....0..1..0....0..0..1....0..1..0....0..0..0
..0..1..0....1..1..0....0..1..0....0..0..1....0..1..0....0..0..0....0..0..1
..0..0..0....0..1..0....0..1..0....0..1..0....0..0..0....0..1..0....1..1..0
		

A221292 Equals two maps: number of 4Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 4Xn array.

Original entry on oeis.org

1, 37, 556, 9107, 172904, 2890017, 49684593, 821323042, 13475380990
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Row 4 of A221290

Examples

			Some solutions for n=3
..0..1..0....0..0..0....0..0..1....0..1..0....0..1..1....0..1..0....0..0..1
..0..0..0....0..1..0....0..1..0....0..1..0....1..1..0....1..0..0....1..0..0
..1..1..0....0..1..1....1..1..1....1..0..0....0..0..0....0..0..1....0..1..1
..0..0..0....1..1..0....0..0..0....0..1..0....1..1..0....0..0..0....1..0..0
		

A221293 Equals two maps: number of 5Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 5Xn array.

Original entry on oeis.org

1, 114, 3332, 123958, 4983598, 172905144, 6138441061
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Row 5 of A221290

Examples

			Some solutions for n=3
..0..0..1....0..0..0....0..0..0....0..0..1....0..1..0....0..1..0....0..1..1
..0..0..0....0..1..0....0..0..1....1..0..0....1..0..1....0..0..0....1..0..1
..0..1..0....1..1..0....1..0..0....0..0..0....1..0..1....0..0..0....1..1..0
..0..1..1....1..0..0....0..1..1....1..1..0....1..0..1....1..0..1....0..1..1
..0..0..0....0..0..0....1..0..0....1..0..0....0..1..0....1..1..0....1..0..0
		

A221294 Equals two maps: number of 6Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 6Xn array.

Original entry on oeis.org

1, 351, 19996, 1686304, 143511784, 10344276279
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Row 6 of A221290

Examples

			Some solutions for n=3
..0..1..0....0..0..0....0..0..1....0..0..1....0..0..1....0..1..1....0..1..0
..0..1..1....0..0..0....0..1..0....1..0..1....0..1..0....0..1..0....1..1..0
..1..0..1....1..0..0....0..0..0....0..0..0....1..1..0....0..1..1....0..0..1
..0..0..0....0..1..0....1..1..0....0..0..1....0..0..0....0..1..0....0..1..0
..0..1..1....0..0..0....0..1..1....1..0..1....1..1..0....1..1..0....1..1..0
..1..1..0....1..1..0....1..1..0....0..1..0....1..1..0....0..0..0....1..0..0
		

A221295 Equals two maps: number of 7Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 7Xn array.

Original entry on oeis.org

1, 1081, 119972, 22931365, 4129628435, 618825190371
Offset: 1

Views

Author

R. H. Hardin Jan 09 2013

Keywords

Comments

Row 7 of A221290

Examples

			Some solutions for n=3
..0..1..0....0..0..1....0..0..0....0..0..0....0..0..0....0..1..0....0..0..0
..1..0..0....0..0..1....0..1..1....1..1..1....0..1..1....1..0..1....0..0..1
..0..0..1....1..0..0....0..1..1....0..1..1....1..0..0....1..0..0....1..0..1
..0..0..0....0..0..0....0..0..0....0..1..1....0..0..0....0..0..0....1..0..1
..0..0..1....1..1..0....0..0..1....0..0..1....1..1..1....0..1..1....1..0..1
..1..0..0....1..1..0....1..0..0....1..0..0....0..1..1....0..1..1....0..1..0
..0..1..0....0..0..0....0..1..0....1..0..0....0..1..0....0..1..0....0..0..0
		
Showing 1-8 of 8 results.