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.

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

Original entry on oeis.org

4, 64, 324, 2025, 15625, 102400, 692224, 4826809, 32867289, 224820036, 1544804416, 10578122500, 72482100625, 496981290961, 3405885014016, 23343276294144, 160005726539569, 1096673231227249, 7516662847716100, 51520374361000000
Offset: 1

Views

Author

R. H. Hardin, Nov 02 2015

Keywords

Comments

Column 3 of A264059.

Examples

			Some solutions for n=4
..0..1..2..3....6..1..2..9....0..7..8..9....0..1..2..9....0..7..2..9
.10..5..6.13....4..5..0..7....4..5..6..1....4..5..6..7....4..5..6..1
..8..9..4.17....8..3.16.17....2..3.10.17....8..3.10.17...14..3.16.17
.18..7.14.15...18.13.14.15...12.19.14.15...18.19.14.15...12.19..8.15
.16.11.12.19...10.11.12.19...16.11.18.13...16.11.12.13...10.11.18.13
		

Crossrefs

Cf. A264059.

Formula

Empirical: a(n) = 7*a(n-1) -a(n-2) +55*a(n-3) -385*a(n-4) +55*a(n-5) -385*a(n-6) +2695*a(n-7) -385*a(n-8) +385*a(n-9) -2695*a(n-10) +385*a(n-11) -55*a(n-12) +385*a(n-13) -55*a(n-14) +a(n-15) -7*a(n-16) +a(n-17).