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.

A263441 Number of nX3 arrays of permutations of 0..n*3-1 with each element moved a city block distance of 0 or 3.

Original entry on oeis.org

1, 4, 49, 1770, 52352, 1095488, 20725780, 482961978, 11815143411, 287647951708, 6707640025800, 157137244838144, 3691446486456184, 87568971473535200, 2068832357068222368, 48886506679849706508, 1152745723771781775300
Offset: 1

Views

Author

R. H. Hardin, Oct 18 2015

Keywords

Comments

Column 3 of A263442.

Examples

			Some solutions for n=4
..9..8..7....0..6..2....0..6.11....7.10..2....5..8.11....5..1.11....7..8..3
..3..4..5....3.11.10....8..9.10....3.11..6...10..9..0....2..9..0....2.11..6
..6..2..1....5..7..9....5..7..1....1..0..9....6..7..3....6..7..3....5..0..1
..0.10.11....8..1..4....4..3..2....8..5..4....4..1..2....8.10..4....9.10..4
		

Crossrefs

Cf. A263442.