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.

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

Original entry on oeis.org

6, 9, 385, 3778, 63575, 828400, 11888603, 163298870, 2275569624, 31552306013, 437685392431, 6074696881202, 84245234781160, 1169032382776504, 16215316393763249, 224976383266144188, 3120908613452812544
Offset: 1

Views

Author

R. H. Hardin, Nov 12 2015

Keywords

Comments

Column 4 of A264379.

Examples

			Some solutions for n=4
..5..2..3..6..9....5..2..3..4..7....1..2..3..8..7....5..6..7..8..9
..0..1.10.13..4....0..1.10.13.12....0.11.10.13..4....0..1.12.11..4
.11.12.15.16.17...15..6.17..8..9....5..6.15.14..9....2..3.13.16.17
..7..8.20.23.24...20.11.18.23.22...16.17.20.21.24...10.21.20.23.24
.21.22.14.18.19...21.16.14.24.19...12.22.23.18.19...15.22.14.18.19
		

Crossrefs

Cf. A264379.