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.

A253294 T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock sum differing from its neighbors horizontally, vertically, diagonally and antidiagonally.

Original entry on oeis.org

81, 558, 558, 3844, 3600, 3844, 26784, 23546, 23546, 26784, 186624, 167832, 140536, 167832, 186624, 1296000, 1184928, 1029888, 1029888, 1184928, 1296000, 9000000, 8243488, 7431136, 8153960, 7431136, 8243488, 9000000, 62568000, 57474376
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2014

Keywords

Comments

Table starts
.........81.........558.........3844........26784.......186624......1296000
........558........3600........23546.......167832......1184928......8243488
.......3844.......23546.......140536......1029888......7431136.....52784020
......26784......167832......1029888......8153960.....61286116....465921688
.....186624.....1184928......7431136.....61286116....486417836...4028778100
....1296000.....8243488.....52784020....465921688...4028778100..36312321352
....9000000....57474376....376392916...3524494796..32585471254.317292582684
...62568000...402165016...2705942488..26879615668.268974784168
..434972736..2811886280..19441124904.204459584768
.3022785216.19648735840.139538118106

Examples

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

Crossrefs

Column 1 is A185771.

Formula

Empirical for column k:
k=1: [linear recurrence of order 9];
k=2: [order 40].