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.

A230738 Number of (n+3)X(6+3) 0..2 black square subarrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.

Original entry on oeis.org

1172, 54138, 1025430, 46599682, 801845362, 36695929036, 625553036008, 28644012159382, 487784854592488, 22335960353679258, 380324726478587580, 17415157060199286942, 296532282288946047888, 13578285711710490028400
Offset: 1

Views

Author

R. H. Hardin, Oct 28 2013

Keywords

Comments

Column 6 of A230739

Examples

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