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.

Previous Showing 11-13 of 13 results.

A263524 Number of (6+1)X(n+1) arrays of permutations of 0..n*7+6 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order.

Original entry on oeis.org

547, 41035, 4213002, 362159570, 30867389241, 2543460828164, 206581153730159, 16572337392178369, 1318639365847533759, 104272166323846221854, 8207516654911011254296, 643763147421954338071019
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Row 6 of A263519.

Examples

			Some solutions for n=2
..0..1..5....0..4..5....0..1..2....0..4..5....0..1..2....0..1..2....0..1..5
..3..4..2....3..1..2....6..3..5....3..1..2....6..3..5....4..3..5....4..3..2
..6..7..8....7..6..8....7..4..8....7..6..8....7..4..8....6..7.11....6..8..7
..9.13.14....9.11.10...10..9.11....9.11.10....9.11.10....9.10..8....9.10.11
.12.10.11...15.12.17...12.14.17...15.12.14...15.12.13...13.12.14...12.13.17
.18.15.17...16.13.14...15.13.20...18.13.16...16.17.14...16.15.17...16.15.14
.19.16.20...18.19.20...18.16.19...19.20.17...18.19.20...19.18.20...19.18.20
		

Crossrefs

Cf. A263519.

A263525 Number of (7+1)X(n+1) arrays of permutations of 0..n*8+7 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order.

Original entry on oeis.org

1575, 240237, 53712998, 9866744449, 1805523575884, 319022980139204, 55588636099730695, 9567638169477949121, 1633596504493958096947, 277222641856926258001248, 46832138508130606828637749
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Row 7 of A263519.

Examples

			Some solutions for n=1
..0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1
..4..2....2..5....4..2....4..2....3..2....3..2....2..5....3..2....3..2....2..3
..5..3....4..3....6..3....5..3....4..5....4..5....4..3....4..7....5..4....5..4
..6..9....6..7....7..5....6..7....6..9....6..7....6..7....6..5....8..6....6..7
..8..7....8..9....8..9...10..8....8..7....8.11...10..8....8..9....9..7....9..8
.10.11...10.11...12.10...11..9...11.10...10..9...12..9...10.11...10.11...10.11
.12.13...13.12...13.11...12.13...13.12...12.15...13.11...13.12...13.12...12.13
.15.14...14.15...15.14...14.15...15.14...14.13...15.14...15.14...14.15...14.15
		

Crossrefs

Cf. A263519.

A263512 Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 filled by rows with each element moved a city block distance of 0 or 1.

Original entry on oeis.org

3, 35, 2076, 489294, 529329240, 2543460828164, 55588636099730695, 5525569263450576586033
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Diagonal of A263519.

Examples

			Some solutions for n=3
..0..1..3..7....0..1..6..7....0..1..6..7....0..1..2..3....0..1..3..7
..8..4..2..6....5..4..2..3....4..5..2..3....4..6..5..7....4..5..2..6
.12..5.11.10....8.13.14.10....8..9.10.11....9..8.11.10....9..8.11.10
.13..9.14.15...12..9.15.11...12.13.14.15...13.12.15.14...13.12.14.15
		

Crossrefs

Cf. A263519.
Previous Showing 11-13 of 13 results.