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.

A209106 Number of 7Xn 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.

Original entry on oeis.org

365, 254496, 125526240, 57113932788, 25586970618660, 11437585318270860, 5112092569118325704, 2285013663964828552960, 1021387683873603848380972, 456557468966590708568722520, 204080223921705625484844604564
Offset: 1

Views

Author

R. H. Hardin Mar 05 2012

Keywords

Comments

Row 7 of A209100

Examples

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