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.

A230757 T(n,k)=Number of (n+3)X(k+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

12, 192, 192, 2700, 5544, 2700, 31212, 178608, 178608, 31212, 363312, 4838400, 13305708, 4838400, 363312, 4120752, 129731328, 820317888, 820317888, 129731328, 4120752, 46949808, 3423037464, 51048476748, 116879941620, 51048476748
Offset: 1

Views

Author

R. H. Hardin, Oct 29 2013

Keywords

Comments

Table starts
.......12.........192............2700..............31212................363312
......192........5544..........178608............4838400.............129731328
.....2700......178608........13305708..........820317888...........51048476748
....31212.....4838400.......820317888.......116879941620........17027460691212
...363312...129731328.....51048476748.....17027460691212......5769362600920812
..4120752..3423037464...3154520054700...2446111719135732...1928867953682733132
.46949808.90231813552.194576103540300.350956390609736652.645610139671314494208

Examples

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

Formula

Empirical for column k:
k=1: [order 15]
k=2: [order 36]
T(n,k)=3*A230708(n,k)*A230739(n,k)