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.

A264340 Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 with each element having index change +-(.,.) 0,0 0,1 or 1,2.

Original entry on oeis.org

9409, 1759250, 345358201, 67833964762, 13323150080401, 2616784941180034, 513959727627375369, 100946240914292115722, 19826735452231888373729, 3894146380641069135233138, 764844826340243559292129305
Offset: 1

Views

Author

R. H. Hardin, Nov 11 2015

Keywords

Comments

Column 7 of A264341.

Examples

			Some solutions for n=1
..1..0..3..2..5..4..6..7....0..1..2..3..4..5..7..6....0..2..1..3.14.15..7..6
..8.10..9.11.12.13.15.14....9..8.10.11.12.14.13.15....8.10..9.11.13.12..4..5
		

Crossrefs

Cf. A264341.

Formula

Empirical: a(n) = 191*a(n-1) +1102*a(n-2) -7594*a(n-3) -38349*a(n-4) +38507*a(n-5)