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.

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

2700, 178608, 13305708, 820317888, 51048476748, 3154520054700, 194576103540300, 11996844809605932, 739805051154249408, 45610762080137185200, 2812209212644935163212, 173386992056092099438572
Offset: 1

Views

Author

R. H. Hardin, Oct 29 2013

Keywords

Comments

Column 3 of A230757.

Examples

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

Crossrefs

Cf. A230757.