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.

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

Original entry on oeis.org

169, 10933, 707281, 33729146, 1608491236, 80568542340, 4035639032100, 200983996390320, 10009459836154944, 498478049285216352, 24824552941574755216, 1236574408590216008500, 61596930731403632640625
Offset: 1

Views

Author

R. H. Hardin, Nov 10 2015

Keywords

Comments

Row 5 of A264272.

Examples

			Some solutions for n=2
..3..1..2....3..1..5....5..4..2....5..1..2....3..1..2....0..4..2....5..4..2
..0..4..5....0..4..2....3..1..0....6..7..0....0..4..8....3..1..8....6..1..0
..6.10..8....6..7..8....6.10.11...11..4..3....9.10..5....9..7..5....3.10.11
..9..7.11....9.10.11....9..7..8...14.10..8....6..7.11....6.13.14....9..7..8
.15.13.14...15.13.14...15.16.17...12.13..9...12.13.17...17.10.11...12.16.14
.12.16.17...12.16.17...12.13.14...15.16.17...15.16.14...15.16.12...15.13.17
		

Crossrefs

Cf. A264272.