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.

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

Original entry on oeis.org

2265, 89472, 102742049, 24130893568, 11743850653769, 4076407512902784, 1657544942470731697, 626331966744150934080, 244930759401226928002489, 94266499744006937216442880, 36551500651609006606385234657
Offset: 1

Views

Author

R. H. Hardin, Oct 30 2015

Keywords

Comments

Column 5 of A263973.

Examples

			Some solutions for n=2
..7..3..0..5..2.10....7..8..0..5..2.11....7..6..4..1.11.10....6..8..0..9..2..3
.12.13..1.16..8..4...13..1.14..4..3.16....0..2.13..3.16..5...13..1.10..4..5.16
.14..6..9.17.11.15....6.15.12.17..9.10...14..8.12.17..9.15...14..7.12.17.11.15
		

Crossrefs

Cf. A263973.