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.

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

1, 128, 3249, 63575, 1742881, 45132986, 1187897216, 30373276651, 792780331712, 20444262438305, 530521904672461, 13716515010894393, 355463297798764953, 9199078922790223336, 238250431643039032101, 6167702521336260154448
Offset: 1

Views

Author

R. H. Hardin, Nov 12 2015

Keywords

Comments

Row 5 of A264379.

Examples

			Some solutions for n=4
..5..2..3..4..9....1..2..3..6..7....1..6..5..4..7....5..2..3..4..9
..0..1.10.11.12....0.11..8..9..4....0.11.10..9.12....0..1.10.11.12
.15..6..7..8.19....5.12.15.14.19....2..3.15.18.17...15..6.13.18.19
.20.21.22.13.14...10.17.18.13.22...16..8.22.19.14....7..8.20.21.22
.25.16.17.18.29...21.16.25.26.29...25.13.27.26.29...25.16.14.26.29
.26.27.28.23.24...20.27.28.23.24...20.21.28.23.24...17.27.28.23.24
		

Crossrefs

Cf. A264379.