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.

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

Original entry on oeis.org

0, 72, 1817, 10720, 89472, 1791696, 27783305, 317382472, 3783068416, 51756812704, 698792225489, 8925688199152, 114042394336256, 1490898399253328, 19518200132035505, 253177516072868896, 3279883039710140160
Offset: 1

Views

Author

R. H. Hardin, Oct 30 2015

Keywords

Comments

Row 2 of A263973.

Examples

			Some solutions for n=4
..5..3..4..1..9....2..6..4..1..9....6..3..8..9..2....6..5..0..8..2
..7..0.12..2.14...10..0..3.14..7....0..1.11..4.14...10.11..1..3..4
..6.13.10.11..8....5.13..8.11.12....5.13.10..7.12...12.13.14..7..9
		

Crossrefs

Cf. A263973.