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

A264064 Number of (7+1)X(n+1) arrays of permutations of 0..n*8+7 with each element having index change +-(.,.) 0,0 1,2 or 2,-2.

Original entry on oeis.org

1, 832, 692224, 74880000, 8100000000, 1869178500000, 431336822822500
Offset: 1

Views

Author

R. H. Hardin, Nov 02 2015

Keywords

Comments

Row 7 of A264059.

Examples

			Some solutions for n=2
..0..1..2....5..1..2....5..1..2....0..1..2....0..1..6....0..1..2....5..1..2
..3..4..5....3..4..0....8..4..0....3..4..5....3..4..9....3..4..5....8..4..0
..6..7.12...11..7..8...11..7..3....6..7.12....2..7..8...11..7..8...11..7..3
..9.10.11....9.10..6....9.10..6...14.10.15....5.10.11....9.10..6...14.10..6
..8.13.14...17.13.14...12.13.14....8.13..9...17.13.14...12.13.14...12.13..9
.15.16.21...15.16.12...15.16.17...11.16.17...15.16.12...20.16.21...20.16.21
.23.19.20...23.19.20...18.19.20...23.19.20...18.19.20...18.19.15...18.19.15
.17.22.18...21.22.18...21.22.23...21.22.18...21.22.23...17.22.23...17.22.23
		

Crossrefs

Cf. A264059.
Previous Showing 11-11 of 11 results.