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.

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

Original entry on oeis.org

1, 320, 102400, 5760000, 324000000, 34260048000, 3622687928896, 311933405047264, 26859186077900176
Offset: 1

Views

Author

R. H. Hardin, Nov 02 2015

Keywords

Comments

Row 6 of A264059.

Examples

			Some solutions for n=3
..0..7..2..9....0..1..8..9....0..1..2..9....6..1..8..9....0..7..8..3
..4..5.12..1....4..5..6.13...10.11.12..7...10..5..0.13....4.11.12..1
.14..3.10.11....2..3.10.17....8..3..4..5....2..3..4.11....2..9.10..5
..6.19..8.15...12..7.14.15....6.19.20.21...18..7.14.15....6.19.14.15
.22.17.24.13...16.11.24.25...22.23.18.13...22.23.12.19...16.17.18.13
.26.21.16.23...20.21.22.23...14.15.16.17...26.21.16.17...26.27.22.23
.18.25.20.27...18.19.26.27...24.25.26.27...24.25.20.27...24.25.20.21
		

Crossrefs

Cf. A264059.