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.

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

Original entry on oeis.org

1, 79008, 8403205056, 1122409297218768, 173357342638694530002, 29526013062983124375791088, 5395269899168064415277849230476
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Row 7 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..0....2..3....1..2....2..3....0..1....2..3....2..3....2..3....2..3....2..3
..3..4....4..2....3..4....4..0....2..3....1..3....4..5....4..5....2..0....4..3
..5..6....5..0....5..0....5..4....4..5....4..0....3..4....4..5....4..5....5..1
..3..2....6..5....6..3....2..5....6..2....5..4....6..2....1..6....3..1....2..6
..6..1....6..4....5..2....6..1....5..6....6..5....5..0....2..0....6..4....5..4
..5..4....3..1....4..6....6..3....3..4....6..2....6..1....3..6....5..6....6..0
		

Crossrefs

Cf. A264945.