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.

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

Original entry on oeis.org

45, 720, 15488, 297920, 5953600, 117534144, 2330885440, 46152976320, 914311870272, 18109587264960, 358715709133120, 7105316641612736, 140740716602145600, 2787757236154376640, 55219250117210191168
Offset: 1

Views

Author

R. H. Hardin, Nov 04 2015

Keywords

Comments

Column 4 of A264142.

Examples

			Some solutions for n=3
..0..1..8..3..4....0..1..5..6..4....0..1..8..6..4....0..1..5..3..4
.11..6..7..2.12....2..3.13..8..9....2.12.13.14..3...11..6.13..2.12
.10..5..9.16.14...10.11.15..7.14....7..5..9.16.17...16..8..9..7.14
.15.13.17.18.19...12.16.17.18.19...15.10.11.18.19...15.10.17.18.19
		

Crossrefs

Cf. A264142.

Formula

Empirical: a(n) = 19*a(n-1) +16*a(n-2) -304*a(n-3) +5776*a(n-4) +4864*a(n-5) +4096*a(n-6) -77824*a(n-7) -65536*a(n-8)