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.

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

Original entry on oeis.org

1, 89, 7921, 269225, 9150625, 398967250, 17394972100, 744568640640, 31870270181376, 1369690710968448, 58865288340403204, 2529832159410757762, 108723679696921023361, 4672588420041689987741, 200812579228092423992521
Offset: 1

Views

Author

R. H. Hardin, Nov 01 2015

Keywords

Comments

Row 5 of A264017.

Examples

			Some solutions for n=3
..0..1..2..3...10.11..2..3....0..1..2..3....6..1..2..3....6..1..2..3
..4.15..6..7....4.15..6..7...10..5..6..7....4.11..0..7...10..5..0..7
.14..9.10.11....8.19..0..1...18.19..4.11...18.15.10..5...18.15..4.11
.18.19..8..5...12.23.14..5...12.13.14.15...12.13.14..9...12.13.14..9
.22.23.12.13...22.17.18..9...16.23..8..9...22.23..8.19...22.23..8.19
.20.21.16.17...20.21.16.13...20.21.22.17...20.21.16.17...20.21.16.17
		

Crossrefs

Cf. A264017.

Formula

Empirical: a(n) = 43*a(n-1) -a(n-2) +1848*a(n-4) -79464*a(n-5) +1848*a(n-6) -1848*a(n-8) +79464*a(n-9) -1848*a(n-10) +a(n-12) -43*a(n-13) +a(n-14) for n>18