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.

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

Original entry on oeis.org

1, 16, 61, 660, 6107, 37225, 349391, 2557552, 19278771, 156296532, 1179331101, 9153019452, 71351814352, 548547053971, 4256314971079, 32951502011481, 254689445056816, 1972727580974503, 15263452717088948, 118105432842264754
Offset: 1

Views

Author

R. H. Hardin, Nov 19 2015

Keywords

Comments

Row 5 of A264628.

Examples

			Some solutions for n=4
..5..2..3..4..9....1..6..3..4..9....1..2.12..4.14....5..6..7..4..9
.10..0..1.13.14...10..0.12..2.14....6..0.17..9..3...10..0..1..2..3
.11.12..6..7..8...11..5.13..7..8...11..5.13..7..8...15.12.13.14..8
.16.21.18.19.24...16.17.22.19.24...16.10.22.19.24...16.17.11.19.24
.25.15.27.17.29...25.15.27.28.18...25.15.27.28.18...25.22.27.28.18
.26.20.28.22.23...26.20.21.29.23...26.20.21.29.23...26.20.21.29.23
		

Crossrefs

Cf. A264628.