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.

A220764 Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 4Xn array.

Original entry on oeis.org

256, 956, 68212, 548130, 21154028, 252705768, 7140289348, 106444390252, 2538132156370, 42707545977344, 928959886709234, 16705185128697224, 345677236914253406, 6446898251377310532, 129826343410954387220
Offset: 1

Views

Author

R. H. Hardin Dec 19 2012

Keywords

Comments

Row 4 of A220761

Examples

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