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.

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

Original entry on oeis.org

16, 377, 12100, 239580, 5645376, 130697424, 3057071776, 70815364224, 1640245587376, 37991496430624, 879962725844576, 20381782810954224, 472084850498355776, 10934475563176382624, 253265394378463623376, 5866157880096665663424, 135872523597900600539776
Offset: 1

Views

Author

R. H. Hardin, Nov 02 2015

Keywords

Examples

			Some solutions for n=3:
..5..1..7..3....0..1..7..3....0..6..2..3....5..6..7..3....0..1..7..3
..4..0..6..2...10..5.11..2....4.11..1..7....4..0..1..2....4.10..6..2
.13..9.15.11....8.15..4..6...14..9.15..5....8..9.10.11...14..9..5.11
.17..8.14.10...17.18.14..9...17.18..8.10...18.13.14.15...18..8.19.15
.16.12.18.19...16.12.13.19...16.12.13.19...16.17.12.19...16.17.12.13
		

Crossrefs

Row 4 of A264071.

Formula

Empirical: a(n) = 24*a(n-1) -19*a(n-2) -11*a(n-3) +36*a(n-4) +3*a(n-5) for n > 9.