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

A266456 Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north neighbor modulo 3 and the upper left element equal to 0.

Original entry on oeis.org

1, 5, 39, 357, 3471, 35003, 362265, 3821877, 40918431, 443234475, 4847042025, 53425329675, 592800026625, 6615155585925, 74183656771239, 835491101084757, 9445356930180735, 107140324945955483, 1218962144543118009
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Row 3 of A266455.

Examples

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

Crossrefs

Cf. A266455.

A266452 Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 1, 5, 101, 3417, 184881, 14216101, 1477674733, 199405047857, 33889007175041, 7081268215880805, 1784184251089927605
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Column 2 of A266455.

Examples

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

Crossrefs

Cf. A266455.

A266457 Number of 4Xn arrays containing n copies of 0..4-1 with no element 1 greater than its north neighbor modulo 4 and the upper left element equal to 0.

Original entry on oeis.org

2, 101, 6152, 442285, 34667512, 2875874396, 248188720768, 22053860939581, 2004232543930760, 185418855352374916, 17404087748977051168, 1653341486254703216284, 158659220471195369806688
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Row 4 of A266455.

Examples

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

Crossrefs

Cf. A266455.

A266458 Number of 5Xn arrays containing n copies of 0..5-1 with no element 1 greater than its north neighbor modulo 5 and the upper left element equal to 0.

Original entry on oeis.org

9, 3417, 2079765, 1548940233, 1294905380013, 1166706600769605, 1107835329027759705, 1093576003604580530985, 1112248727149947766472565, 1158391002421511021525838237, 1229934205503034925503524320745
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Row 5 of A266455.

Examples

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

Crossrefs

Cf. A266455.

A266453 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 0, 39, 6152, 2079765, 1362641028, 1511484069811, 2623713101882928, 6717410044413848265
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Column 3 of A266455.

Examples

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

Crossrefs

Cf. A266455.

A266454 Number of nX4 arrays of permutations of 4 copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 3, 357, 442285, 1548940233, 12959331192279, 218375094825289861
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2015

Keywords

Comments

Column 4 of A266455.

Examples

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

Crossrefs

Cf. A266455.
Showing 1-6 of 6 results.