|
%I #4 Mar 05 2014 06:02:22
%S 3,6,6,14,30,14,32,156,156,32,72,810,1888,810,72,164,4106,22242,22242,
%T 4106,164,372,21132,258720,604412,258720,21132,372,844,108124,3044922,
%U 16041854,16041854,3044922,108124,844,1916,553828,35640158,432845880
%N T(n,k)=Number of nXk 0..3 arrays with no element equal to the sum modulo 4 of elements to its left or elements above it
%C Table starts
%C ....3.......6.........14............32................72..................164
%C ....6......30........156...........810..............4106................21132
%C ...14.....156.......1888.........22242............258720..............3044922
%C ...32.....810......22242........604412..........16041854............432845880
%C ...72....4106.....258720......16041854.........976810146..........60277582112
%C ..164...21132....3044922.....432845880.......60277582112........8524103612876
%C ..372..108124...35640158...11591229010.....3697656930974.....1196624830872094
%C ..844..553828..417759376..311132395064...227187542722224...168396084501288492
%C .1916.2837376.4896355616.8346793174230.13955749970865816.23680768603975178514
%H R. H. Hardin, <a href="/A238775/b238775.txt">Table of n, a(n) for n = 1..180</a>
%F Empirical for column k:
%F k=1: a(n) = a(n-1) +2*a(n-2) +2*a(n-3)
%F k=2: [order 10]
%F k=3: [order 35]
%e Some solutions for n=3 k=4
%e ..2..3..3..1....2..3..2..2....3..2..2..2....1..3..2..3....3..2..2..1
%e ..1..2..1..2....3..2..0..3....2..0..0..1....3..1..1..0....2..1..0..0
%e ..1..3..3..1....2..0..0..3....2..1..0..2....3..1..1..0....2..0..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Mar 05 2014
| 