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.

A217643 Number of nX6 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random 0..2 nX6 array.

Original entry on oeis.org

77, 959, 29101, 779051, 22516459, 644993621, 18482872753, 531602056509, 15267905480487, 438705879899041, 12606649476815151, 362239882955092205, 10409031887717391513, 299103662135939293765, 8594751629843753626189
Offset: 1

Views

Author

R. H. Hardin Oct 09 2012

Keywords

Comments

Column 6 of A217645

Examples

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