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.

A264939 Number of n X n arrays containing n copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

1, 2, 56, 184740, 137409486772, 36724170744914466520, 5395269899168064415277849230476
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Diagonal of A264945.

Examples

			Some solutions for n=4
..0..1..2..0....0..1..2..0....0..1..0..1....0..1..2..0....0..1..0..2
..3..2..0..3....0..2..3..1....2..1..3..0....3..2..1..2....2..1..2..3
..3..2..1..3....1..2..1..3....2..3..2..3....0..3..0..1....0..1..0..3
..0..1..2..1....2..3..0..3....2..3..0..1....3..1..3..2....2..3..1..3
		

Crossrefs

Cf. A264945.