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.

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

Original entry on oeis.org

1, 6040, 43200625, 368696849320, 3537141103745065, 36724170744914466520
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Row 6 of A264945.

Examples

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

Crossrefs

Cf. A264945.