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.

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

363312, 129731328, 51048476748, 17027460691212, 5769362600920812, 1928867953682733132, 645610139671314494208, 215988462456574388976300, 72238352925469656400705200, 24160858241776435434419641008
Offset: 1

Views

Author

R. H. Hardin, Oct 29 2013

Keywords

Comments

Column 5 of A230757

Examples

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