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.

A218515 Number of n X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..3 n X n array.

Original entry on oeis.org

4, 36, 4634, 1608968, 3856183182, 40522780697742, 2345237392530015812, 681081741849413830473468, 1012037226170162671485394009190
Offset: 1

Views

Author

R. H. Hardin Oct 31 2012

Keywords

Comments

Diagonal of A218522

Examples

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