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.

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

Original entry on oeis.org

36, 864, 20736, 395280, 7535025, 150305220, 2998219536, 59481442800, 1180047690000, 23367447097200, 462725013969936, 9164960558748720, 181525743168224400, 3595660883206991280, 71222830224380145936
Offset: 1

Views

Author

R. H. Hardin, Nov 07 2015

Keywords

Comments

Column 4 of A264195.

Examples

			Some solutions for n=3
.11..3.13..1..4....0..1..2..3..4....0..1..2.14..4....2..1..0..3..4
..5..6.18..8..9....5.17..9..8..7....5..8.18..6..9....5.17..7..6..9
.12..0.10..2.14...12.11.10.13.14...12.11.10.13..3...12.13.10.11.14
.15.16.19..7.17...15.16..6.18.19...15.16.19..7.17...15.18.19.16..8
		

Crossrefs

Cf. A264195.

Formula

Empirical: a(n) = 19*a(n-1) +16*a(n-2) -6032*a(n-4) +114608*a(n-5) +96512*a(n-6) +1544192*a(n-8) -29339648*a(n-9) -24707072*a(n-10) +16777216*a(n-12) -318767104*a(n-13) -268435456*a(n-14) for n>16