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.

A229320 T(n,k)=Number of nXk 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..3 array without adjacent equal elements in the latter.

Original entry on oeis.org

4, 14, 14, 50, 154, 50, 176, 1494, 1494, 176, 622, 13968, 34022, 13968, 622, 2196, 129766, 717882, 717882, 129766, 2196, 7756, 1203222, 14972226, 33330044, 14972226, 1203222, 7756, 27390, 11146054, 310664552, 1520769276, 1520769276
Offset: 1

Views

Author

R. H. Hardin Sep 19 2013

Keywords

Comments

Table starts
.....4........14...........50.............176..............622.............2196
....14.......154.........1494...........13968...........129766..........1203222
....50......1494........34022..........717882.........14972226........310664552
...176.....13968.......717882........33330044.......1520769276......69027667944
...622....129766.....14972226......1520769276.....151503568022...14999158146398
..2196...1203222....310664552.....69027667944...14999158146398.3239971166331308
..7756..11146054...6441333794...3129534386120.1483911991489430
.27390.103236194.133479301256.141829123448362

Examples

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

Formula

Empirical for column k:
k=1: a(n) = 3*a(n-1) +2*a(n-2) -a(n-3) +2*a(n-4)
k=2: [order 65]