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.

A268104 Number of 1Xn 0..n arrays with every repeated value in every row and column greater than or equal to the previous repeated value.

Original entry on oeis.org

2, 9, 64, 615, 7536, 112476, 1981512, 40265487, 927338710, 23873974553, 679478391252, 21185458961316, 718142599280848, 26296505423775240, 1034431689380433024, 43505385550994833263, 1948060006167232265688
Offset: 1

Views

Author

R. H. Hardin, Jan 26 2016

Keywords

Comments

Row 1 of A268103.

Examples

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

Crossrefs

Cf. A268103.

A268105 Number of 2Xn 0..n arrays with every repeated value in every row and column greater than or equal to the previous repeated value.

Original entry on oeis.org

4, 81, 4096, 378225, 56791296, 12650850576, 3926389806144, 1621309443347169, 859957083064464100, 569966660957291549809, 461690884178405990127504, 448823671401604409584451856, 515728792901852626366779599104
Offset: 1

Views

Author

R. H. Hardin, Jan 26 2016

Keywords

Comments

Row 2 of A268103.

Examples

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

Crossrefs

Cf. A268103.

A268102 Number of nX4 0..4 arrays with every repeated value in every row and column greater than or equal to the previous repeated value.

Original entry on oeis.org

615, 378225, 232608375, 134114290153, 74223748225767, 39628019998736362, 20521193142295758827, 10349487304333681128069, 5100109128493173791160887, 2462335083143368720711957677, 1167299758811224888022222919608
Offset: 1

Views

Author

R. H. Hardin, Jan 26 2016

Keywords

Comments

Column 4 of A268103.

Examples

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

Crossrefs

Cf. A268103.

A268106 Number of 3Xn 0..n arrays with every repeated value in every row and column greater than or equal to the previous repeated value.

Original entry on oeis.org

8, 729, 262144, 232608375, 427979206656, 1422917069386176, 7780188517552009728, 65282814314072669856303, 797471492064362985335311000, 13607369559752757079941998010377
Offset: 1

Views

Author

R. H. Hardin, Jan 26 2016

Keywords

Comments

Row 3 of A268103.

Examples

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

Crossrefs

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