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.

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

Original entry on oeis.org

0, 13856, 2940624, 226810352, 24130893568, 4071813326144, 609140174072448, 78375823545772864
Offset: 1

Views

Author

R. H. Hardin, Oct 30 2015

Keywords

Comments

Row 4 of A263973.

Examples

			Some solutions for n=2
..2..5..0....2..5..0....4..5..0....2..5..0....2..5..0....2..3..0....2..4..5
..1..7..8....1..8..7....1..2..7....1..6..8....1..8..3....5..1..7....1..0..8
..4..3.11....4..3..6....9..3.10....3.10..4....4.11..6....9..4.11....3..9.11
.13..6..9...12.14.13....6.13..8...13.12..7...13.12..7....6.13..8...13..6..7
.14.10.12....9.10.11...14.11.12...14..9.11...14..9.10...14.10.12...14.10.12
		

Crossrefs

Cf. A263973.