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.

A263971 Number of (n+1)X(4+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

465, 10720, 2604481, 226810352, 31702909989, 3594130469760, 448695451459909, 53640316831369632, 6540831457433886617, 790462142954177461984, 95918547752313363235977, 11617678126362988189598288
Offset: 1

Views

Author

R. H. Hardin, Oct 30 2015

Keywords

Comments

Column 4 of A263973.

Examples

			Some solutions for n=2
..2..3..4..1..8....6..7..0..8..2....5..6..4..1..8....2..6..4..9..8
.11..0..5.14..7....1.10.13..4..3....0..2.11.14..3....0.10..1.13..3
..6.13.10..9.12...12..5.14.11..9...12.13.10..7..9....5..7.14.11.12
		

Crossrefs

Cf. A263973.

Formula

Empirical recurrence of order 53 (see link above)