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.

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

Original entry on oeis.org

1, 13, 169, 1040, 6400, 53280, 443556, 3383280, 25806400, 203738480, 1608491236, 12558632416, 98054154496, 768752950768, 6027088830169, 47188038099235, 369450492999025, 2893968831142495, 22668952280018641, 177540636808778880
Offset: 1

Views

Author

R. H. Hardin, Nov 03 2015

Keywords

Comments

Row 2 of A264131.

Examples

			Some solutions for n=4
..0..3..4..1..2....0..1..9..3..4....0..1..4..3..2....2..1..0..3..4
..5..8.14..6..9....7..6..5..8..2....5..8..7..6..9....7..6.14..8..9
.12.13.10.11..7...10.13.12.11.14...10.11.14.13.12...10.11..5.13.12
		

Crossrefs

Cf. A264131.