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.

A264369 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,2 1,0 or -1,-2.

Original entry on oeis.org

1, 60, 3600, 54720, 831744, 16066704, 310358689, 5669414855, 103564894225, 1897896238940, 34780223170576, 635711773067072, 11619518840752384, 212144954220192048, 3873265512788926881, 70687878202585153191
Offset: 1

Views

Author

R. H. Hardin, Nov 12 2015

Keywords

Comments

Row 5 of A264364.

Examples

			Some solutions for n=4
..0..8..9..1..2....0..1..2..3..4....7..1..0..3..2....0..8..2..3..4
..5..6.14..3..4...12..6..5..8..9...12..6.14..8..4....5..1..7..6..9
.10.18..7.13.12...10.18..7.11.14....5.11.10.13..9...17.18.10.13.14
.15.11.17.16.19...15.16.17.13.19...15.23.24.16.17...22.11.12.16.19
.27.28.20.21.24...27.28.29.21.22...27.28.22.18.19...15.28.20.23.24
.25.26.22.23.29...20.26.25.23.24...20.21.25.26.29...25.21.27.26.29
		

Crossrefs

Cf. A264364.