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.

A230705 Number of (n+3)X(5+3) 0..2 white 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

348, 6576, 130446, 2382398, 43853402, 801845362, 14669811856, 268320990890, 4907081716780, 89741960163156, 1641217724600070, 30014492191668694, 548906193959555044, 10038390389027140378, 183582034355172126804
Offset: 1

Views

Author

R. H. Hardin, Oct 28 2013

Keywords

Comments

Column 5 of A230708

Examples

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