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.

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

Original entry on oeis.org

1, 351, 4843, 137584, 4023076, 95946259, 2486418295, 64826165535, 1652429011909, 42508454066939, 1094317644738425, 28099100591929747, 722286772733295541, 18567899507526341784, 477183716427656944275, 12264894190427166009575
Offset: 1

Views

Author

R. H. Hardin, Nov 12 2015

Keywords

Comments

Row 5 of A264422.

Examples

			Some solutions for n=4
.11.12..8..9..7....6..0..8..9..7....6.12..8..2..3...11..0..8..9..3
..0..1.13..3..4...16..1..2..3..4...11..1.13..7..4...16..1.13..7..4
.16..6.18.24..2....5.22.18.24.13...16.10..0.24..9....5..6.18.12..2
.10.22..5.17.14...10.11.12.17.14...21.15..5.29.14...21.22.28.24.14
.15.27.25.29.19...15.27.21.29.19...26.27.28.18.19...15.27.10.29.19
.20.21.26.23.28...20.25.26.23.28...20.25.22.23.17...20.25.26.23.17
		

Crossrefs

Cf. A264422.