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-4 of 4 results.

A269506 Number of 2Xn arrays containing n copies of 0..2-1 avoiding the pattern down-up in every row and column.

Original entry on oeis.org

2, 6, 14, 34, 92, 258, 722, 2022, 5706, 16232, 46442, 133418, 384550, 1111614, 3221582, 9357450, 27233148, 79394646, 231822854, 677835636, 1984435484, 5816254262, 17064740572, 50114985298, 147303657830, 433319078074
Offset: 1

Views

Author

R. H. Hardin, Feb 28 2016

Keywords

Comments

Row 2 of A269505.

Examples

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

Crossrefs

Cf. A269505.

A269507 Number of 3Xn arrays containing n copies of 0..3-1 avoiding the pattern down-up in every row and column.

Original entry on oeis.org

4, 54, 420, 3088, 25226, 239994, 2338286, 23240168, 232006814, 2352889414, 24069853302, 248560741574, 2582277394354, 26997628173380, 283652378887212, 2994183763030920, 31727834772912212, 337396544704648686
Offset: 1

Views

Author

R. H. Hardin, Feb 28 2016

Keywords

Comments

Row 3 of A269505.

Examples

			Some solutions for n=4
..1..1..2..0. .1..0..0..1. .0..0..2..1. .0..0..2..2. .0..1..2..1
..1..1..2..2. .2..1..1..2. .0..2..2..1. .1..2..1..1. .0..2..2..1
..0..0..0..2. .0..2..2..0. .2..1..1..0. .1..2..0..0. .2..0..0..1
		

Crossrefs

Cf. A269505.

A269504 Number of nX3 arrays containing 3 copies of 0..n-1 avoiding the pattern down-up in every row and column.

Original entry on oeis.org

1, 14, 420, 18332, 1261420, 134871120, 21338020496
Offset: 1

Views

Author

R. H. Hardin, Feb 28 2016

Keywords

Comments

Column 3 of A269505.

Examples

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

Crossrefs

Cf. A269505.

A269508 Number of 4Xn arrays containing n copies of 0..4-1 avoiding the pattern down-up in every row and column.

Original entry on oeis.org

8, 600, 18332, 480440, 13522204, 492613956, 18677195738, 753228526960, 29963202454514, 1236592684106800
Offset: 1

Views

Author

R. H. Hardin, Feb 28 2016

Keywords

Comments

Row 4 of A269505.

Examples

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

Crossrefs

Cf. A269505.
Showing 1-4 of 4 results.