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.

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

Original entry on oeis.org

9, 61, 2345, 60858, 1742881, 48714516, 1363452981, 38221084820, 1068788896516, 29927513269705, 837176817328453, 23429857747772820, 655532815387819189, 18343277111401479326, 513247057017765586701, 14361187855657149397556
Offset: 1

Views

Author

R. H. Hardin, Nov 12 2015

Keywords

Comments

Column 5 of A264379.

Examples

			Some solutions for n=4
..6..2..3..7..8.11....1..2..3..7.10..9....6..2..8..7.10..9....6..7..8..4.10..9
..0..1.12.10..4.15....0.13.12.15..4..5....0..1.12.13..4..5....0..1.14..3.16.15
.13.19.18..5.17.21....6.14.18.21.17.11...18..3.15.21.17.11....2.19.18..5.17.11
.24..9.14.27.16.29....8.20.24.22.26.27...24.25.26.22.16.27...12.13.24.27.28.29
.25.26.20.28.22.23...25.19.16.28.29.23...14.19.20.28.29.23...25.26.20.21.22.23
		

Crossrefs

Cf. A264379.