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.

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

Original entry on oeis.org

676, 28925, 1243225, 53429620, 2296230561, 98684484373, 4241136597604, 182270189212469, 7833376999538689, 336652940790951028, 14468243077011355641, 621797799370697341405, 26722837129862974324900
Offset: 1

Views

Author

R. H. Hardin, Nov 11 2015

Keywords

Examples

			Some solutions for n=2:
..8..2..1..3..4..5....0..2..1..4..3..5....0..9..2..4..3..5....0..1.10..3..5..4
..6..7..0.17.11.10...14.15..7.10..9.11....6..8..7..1.11.10....7..6..9..8..2.11
.12.14.13.16.15..9...12.13..6.16..8.17...12.13.14.16.15.17...12.14.13.15.17.16
		

Crossrefs

Column 5 of A264341.

Formula

Empirical: a(n) = 43*a(n-1) - 43*a(n-3) + a(n-4).
Empirical g.f.: x*(676 - 143*x - 550*x^2 + 13*x^3) / ((1 - x)*(1 + x)*(1 - 43*x + x^2)). - Colin Barker, Jan 07 2019