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.

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

Original entry on oeis.org

1, 12, 144, 1644, 18769, 169195, 1525225, 14158040, 131423296, 1263160840, 12140734225, 114747871035, 1084536870921, 10220222182842, 96311102247684, 909854806065252, 8595434470172356, 81152480791177280, 766188743735526400
Offset: 1

Views

Author

R. H. Hardin, Nov 16 2015

Keywords

Comments

Row 5 of A264520.

Examples

			Some solutions for n=4
..7..6..0..1..2....5..6..7..1..9....5..6..7..1..9....7..6..0..8..2
.10.13..5..3..4....0.13..2..3..4....0.13..2..3..4...12..1..5..3..4
.15.16.19..8..9...17.18.19..8.12...17.18.19..8.12...15.16.17.11..9
.22.11.12.23.14...10.11.22.23.14...10.11.15.23.14...10.23.22.13.14
.27.28.17.18.29...15.16.27.28.29...25.16.27.28.29...27.28.29.18.19
.20.21.25.26.24...20.21.25.26.24...20.21.22.26.24...20.21.25.26.24
		

Crossrefs

Cf. A264520.