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.

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

Original entry on oeis.org

1, 35, 324, 4772, 217049, 2517024, 89130069, 1749889912, 47485981944, 1036062520569, 27578007781836, 620722292448311, 15966382007038680, 373437492628645406, 9348490299717806516, 222809815180956245674
Offset: 1

Views

Author

R. H. Hardin, Nov 14 2015

Keywords

Comments

Column 5 of A264490.

Examples

			Some solutions for n=4
..6..7..3..9..5.11....6..7..8.17.10.11....6..7..8..9.10.11....6..7..8..9.10.11
.12..1..2.15..4.17...12.13..9..3..4..5....0..1.14..3.16..5...12..1..2..3..4..5
.18..0..8.21.10.23...26..0..1..2.22.23...18.19.20..2.22..4...18..0.20.21.22.23
.24.13.26.27.28.29...24.25.21.27.28.29...24.25.26.27.28.29...24.13.26.15.28.29
.25.19.20.14.22.16...18.19.20.14.15.16...13.12.15.21.17.23...25.19.27.14.17.16
		

Crossrefs

Cf. A264490.