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.

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

Original entry on oeis.org

121, 11305, 643905, 31916832, 1746531193, 96761217077, 5280184936704, 288410304823557, 15799152314227457, 865337374046219193, 47384715752967787849, 2595217499912210034105, 142150854161945612453920
Offset: 1

Views

Author

R. H. Hardin, Oct 27 2015

Keywords

Comments

Row 3 of A263816

Examples

			Some solutions for n=2
..0..2..5....3..2..1....0..1..2....1..4..2....2..1..0....0..4..2....3..1..5
..3..1..4....0..7..4....5..3..4....0..5..3....4..5..3....3..1..5....0..4..2
..8.10..7....6..8..5....8..6..7....6..7..8....6..7..8....9..8..6....8..7..6
..6.11..9...11..9.10...10.11..9....9.10.11....9.10.11...10..7.11....9.10.11
		

Crossrefs