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.

A265235 Number of 5Xn arrays containing n copies of 0..5-1 with no equal vertical neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

1, 372, 222850, 164933040, 137409486772, 123531282436770, 117115132044401100, 115473661661749763520, 117339977328886229407120, 122120444042051198450868012, 129586955944964431527460363320
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2015

Keywords

Comments

Row 5 of A265232.

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

Crossrefs

Cf. A265232.