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.

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

Original entry on oeis.org

27, 69, 787, 3495, 27993, 154447, 1080809, 6526907, 43241983, 270431585, 1753511935, 11117046371, 71479973835, 455588313465, 2919712813815, 18647687495411, 119353646989167, 762902760386741, 4880484858150293
Offset: 1

Views

Author

R. H. Hardin Nov 12 2012

Keywords

Comments

Row 3 of A219128

Examples

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