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.

A217968 Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..2 5Xn array.

Original entry on oeis.org

243, 1523, 72257, 1602741, 48942485, 1368783313, 40300213599, 1170265289539, 34202123230555, 997730409895429, 29128167430767449, 850254151548959837, 24820794901995097417, 724574515854245379961, 21151965211624408172993
Offset: 1

Views

Author

R. H. Hardin Oct 16 2012

Keywords

Comments

Row 5 of A217964

Examples

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