A239649 T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4.
2, 4, 4, 8, 20, 10, 16, 92, 112, 22, 32, 418, 1182, 560, 50, 64, 1898, 12246, 13476, 2874, 114, 128, 8588, 127454, 320314, 158728, 14788, 258, 256, 38888, 1320102, 7629186, 8634040, 1864886, 75540, 586, 512, 175974, 13703468, 181039448, 471203608
Offset: 1
Examples
Some solutions for n=3 k=4 ..3..1..3..1....3..0..1..3....1..0..3..3....3..0..0..0....1..0..3..3 ..2..1..2..0....2..1..1..2....1..0..3..3....2..0..3..0....1..3..2..0 ..1..3..1..0....2..1..1..1....1..0..3..3....2..1..2..3....1..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..180
Formula
Empirical for column k:
k=1: a(n) = a(n-1) +2*a(n-2) +2*a(n-3)
k=2: [order 10]
k=3: [order 35]
Empirical for row n:
n=1: a(n) = 2*a(n-1)
n=2: a(n) = 3*a(n-1) +12*a(n-2) -18*a(n-3) -29*a(n-4) +19*a(n-5) +38*a(n-6) +8*a(n-7)
n=3: [order 25]
n=4: [order 91]
Comments