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.

A205158 Number of n X 5 0..3 arrays with no occurrence of three equal elements in a row horizontally, vertically or nw-to-se diagonally, and new values 0..3 introduced in row major order.

Original entry on oeis.org

40, 31168, 15821727, 8797534495, 4826926610498, 2654271236904226, 1458877292453477918, 801931987315155805350, 440804977416966931974046, 242302335602851559365684237, 133188963363707384391102837136, 73211445306645369967259855981514, 40242939870572168051645146035499410
Offset: 1

Views

Author

R. H. Hardin, Jan 22 2012

Keywords

Examples

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

Crossrefs

Column 5 of A205161.