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.

A230176 T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, vertically, diagonally or antidiagonally next to at least one element with value 2-x(i,j).

Original entry on oeis.org

0, 3, 3, 3, 27, 3, 9, 193, 193, 9, 15, 1407, 3787, 1407, 15, 33, 10211, 78849, 78849, 10211, 33, 63, 73417, 1637019, 4722977, 1637019, 73417, 63, 129, 530771, 33908253, 284444079, 284444079, 33908253, 530771, 129, 255, 3841171, 704822331
Offset: 1

Views

Author

R. H. Hardin, Oct 11 2013

Keywords

Comments

Table starts
...0.......3...........3..............9.................15
...3......27.........193...........1407..............10211
...3.....193........3787..........78849............1637019
...9....1407.......78849........4722977..........284444079
..15...10211.....1637019......284444079........49754476927
..33...73417....33908253....17072965263......8666440899433
..63..530771...704822331..1027868078181...1514677019365483
.129.3841171.14643857893.61861526624839.264644708761844781

Examples

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

Crossrefs

Column 1 is A062510(n-1)

Formula

Empirical for column k:
k=1: a(n) = a(n-1) +2*a(n-2)
k=2: a(n) = 6*a(n-1) -2*a(n-2) +67*a(n-3) +62*a(n-4) +160*a(n-5) +40*a(n-6) +16*a(n-7)
k=3: [order 26] for n>27
k=4: [order 81] for n>82