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.

A230753 Number of (n+3)X(4+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

31212, 4838400, 820317888, 116879941620, 17027460691212, 2446111719135732, 350956390609736652, 50358119242966513344, 7223117962392705998700, 1035950069921732837599728, 148583744714836638940179888
Offset: 1

Views

Author

R. H. Hardin, Oct 29 2013

Keywords

Comments

Column 4 of A230757

Examples

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