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.

A264067 Number of (n+1) X (4+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

34, 605, 12100, 239580, 4745620, 94000060, 1861931060, 36880691100, 730524027860, 14470047586940, 286619288597620, 5677287244745820, 112454366267732500, 2227469555002850620, 44121191405337881780, 873942149581465363740, 17310839904533248019540, 342889032579435158191100
Offset: 1

Views

Author

R. H. Hardin, Nov 02 2015

Keywords

Examples

			Some solutions for n=3:
..0..1..8..9..4....6..8..9..3..4....6..1..8..9..4....0..8..9..3..4
..5..6.14..2..3...12..0.14..1..2...11..0..7..2..3....5..6.13..1..2
.16.17.12.13..7...16..5.18.13..7...10..5.18.19.14...17.11.19..7.14
.15.10.11.18.19...15.10.17.11.19...15.16.17.12.13...15.16.10.18.12
		

Crossrefs

Column 4 of A264071.

Formula

Empirical: a(n) = 19*a(n-1) +16*a(n-2) for n>3.
Empirical g.f.: x*(34 - 41*x + 61*x^2) / (1 - 19*x - 16*x^2). - Colin Barker, Jan 04 2019