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.

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

Original entry on oeis.org

1, 181, 2324, 29742, 537057, 8405669, 131452948, 2106493053, 33373652045, 527999350819, 8361101819256, 132229311039965, 2089823448380709, 33022907786733950, 521708203665257621, 8240560035947933736
Offset: 1

Views

Author

R. H. Hardin, Nov 10 2015

Keywords

Comments

Row 5 of A264285.

Examples

			Some solutions for n=4
..7..0..1..3..4....7..0..1..2..4....7..0..2..3..4....0..1..2..3..4
..5..6..2..8..9...12..5..6..3..9....5..1..6..8..9....5..6..7..8..9
.10.18.11.12.14...10.11.19..8.14...10.11.19.12.14...17.10.11.12.14
.15.23.16.13.19...15.16.17.13.18...15.16.17.13.18...15.16.24.13.19
.27.21.17.22.24...27.20.21.23.24...20.21.29.22.24...27.20.22.18.23
.20.25.26.28.29...25.26.22.28.29...25.26.27.23.28...25.21.26.28.29
		

Crossrefs

Cf. A264285.