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.

A264198 Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 0,2 or 2,1.

Original entry on oeis.org

8, 360, 19845, 395280, 10764800, 324210304, 9863496016, 279809075700, 8157568320000, 238979576637900, 7001055126046864, 204177934975626752, 5968556502961102848, 174493143469741118400, 5100928646184033070545
Offset: 1

Views

Author

R. H. Hardin, Nov 07 2015

Keywords

Comments

Row 4 of A264195.

Examples

			Some solutions for n=3
..2..3..0..1....2..3..0..1....9..3..0..1....2..3..0..1....9..1..0..3
..6..5.15..7...13..7.15..5....6..5.15..7...13..5.15..7...13..7..4..5
.17..9.10.11...10.11.19..9...17.11.10..2....8.11.10..9...10.11..8..2
.14..4.12.13...14..4.12..6...14..4.12.13...14..4.12..6...14.15.12..6
.18..8.16.19...16..8.18.17...18..8.16.19...16.17.18.19...16.17.18.19
		

Crossrefs

Cf. A264195.