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.

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

Original entry on oeis.org

9, 16, 2116, 44521, 1525225, 43731769, 1250046736, 36412654041, 1023636039001, 29395568245824, 828988131959716, 23599139118132769, 667319223491080281, 18929485248132797584, 535857588485957276361, 15182115680784904368400
Offset: 1

Views

Author

R. H. Hardin, Nov 16 2015

Keywords

Comments

Column 7 of A264520.

Examples

			Some solutions for n=4
.10..9..0.13.14..3..4.15....8.11..0..1.12..3.14..5....8..9.10.11..2.13..4..5
.18..1..2.19.22..5..6..7...18.17..2.19..4.21..6..7....0..1.18..3.22.23..6..7
..8.27.26.11.12.29.20.21...26..9.10.27.30.13.20.15...26.27.28.29.12.31.14.15
.16.17.34.37.36.39.38.23...16.35.34.37.38.39.22.23...16.17.36.19.20.21.38.39
.24.25.32.33.28.35.30.31...24.25.32.33.28.29.36.31...24.25.32.33.34.35.30.37
		

Crossrefs

Cf. A264520.