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.

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

Original entry on oeis.org

2, 7, 39, 265, 1802, 12239, 84614, 597601, 4289844, 31138558, 227912351, 1679866698, 12457873439, 92883320659, 695746287346, 5232714491851, 39496475643074, 299071199295812, 2271081847307045, 17290623003826450
Offset: 1

Views

Author

R. H. Hardin, Dec 26 2015

Keywords

Comments

Row 3 of A266309.

Examples

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

Crossrefs

Cf. A266309.

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

Original entry on oeis.org

6, 171, 8190, 442285, 25839438, 1605405629, 103948820622, 6930557596953, 472599444039774, 32808183003171211, 2310785736121024350, 164716310371150628603, 11860112155495496736974, 861339905567424795731145
Offset: 1

Views

Author

R. H. Hardin, Dec 26 2015

Keywords

Comments

Row 4 of A266309.

Examples

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

Crossrefs

Cf. A266309.

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

Original entry on oeis.org

1, 1, 7, 171, 6666, 384360, 30900150, 3314400390, 457970055480, 79281706512960, 16813296291166200, 4287982048554619800
Offset: 1

Views

Author

R. H. Hardin, Dec 26 2015

Keywords

Comments

Column 2 of A266309.

Examples

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

Crossrefs

Cf. A266309.

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

Original entry on oeis.org

1, 1, 39, 8190, 3264584, 2357929910, 2805027363620, 5125417483461520, 13647329614464753200
Offset: 1

Views

Author

R. H. Hardin, Dec 26 2015

Keywords

Comments

Column 3 of A266309.

Examples

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

Crossrefs

Cf. A266309.

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

Original entry on oeis.org

1, 1, 265, 442285, 1935720551, 18647592370365, 346767829206699720, 11380449914002871787995
Offset: 1

Views

Author

R. H. Hardin, Dec 26 2015

Keywords

Comments

Column 4 of A266309.

Examples

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

Crossrefs

Cf. A266309.

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

Original entry on oeis.org

24, 6666, 3264584, 1935720551, 1294905380013, 934699483462236, 710752160484603774
Offset: 1

Views

Author

R. H. Hardin, Dec 26 2015

Keywords

Comments

Row 5 of A266309.

Examples

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

Crossrefs

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