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.

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

Original entry on oeis.org

32, 948, 18776, 333429, 6425985, 124854432, 2392853088, 45898515536, 882504683737, 16961728977667, 325906704633704, 6262921821080860, 120359817883976272, 2313001901843303293, 44449848853940930817, 854215652423448900720, 16415908945488548695104, 315472929981841479177936
Offset: 1

Views

Author

R. H. Hardin, Oct 27 2015

Keywords

Examples

			Some solutions for n=3:
..2..3..0..1....0..1..2..7....1..3..6..7....1..3..6..2....2..0..1..3
..6..7..5.11....4..5.10..3....0..5..2.11....0..9..7..5....4..6..7..5
..4..9..8.10....8.11..6..9....4.10..8..9....4.11..8.10....8.10..9.11
		

Crossrefs

Row 2 of A263816.