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.

A217996 Number of nX3 arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nX3 array.

Original entry on oeis.org

25, 729, 19665, 531143, 14345273, 387332417, 10458051407, 282370309597, 7624012293659, 205848628366997, 5557913837745823, 150063732111219045, 4051720943493086779, 109396471194812694909
Offset: 1

Views

Author

R. H. Hardin Oct 17 2012

Keywords

Comments

Column 3 of A217999

Examples

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