|
%I #4 Mar 09 2014 10:17:17
%S 3,7,7,16,41,16,38,218,218,38,90,1187,2739,1187,90,212,6524,34344,
%T 34344,6524,212,500,35683,432705,996325,432705,35683,500,1180,194936,
%U 5444993,28827920,28827920,5444993,194936,1180,2784,1065802,68414459,831472462
%N T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it, modulo 4
%C Table starts
%C ....3.......7..........16.............38................90..................212
%C ....7......41.........218...........1187..............6524................35683
%C ...16.....218........2739..........34344............432705..............5444993
%C ...38....1187.......34344.........996325..........28827920............831472462
%C ...90....6524......432705.......28827920........1916936295.........126785422189
%C ..212...35683.....5444993......831472462......126785422189.......19230047618078
%C ..500..194936....68414459....23966393838.....8374355016629.....2910650412464677
%C .1180.1065802...859450650...690533224800...552972642874139...440291290383709457
%C .2784.5827642.10797617215.19889264165241.36495962765384251.66567398078863767488
%H R. H. Hardin, <a href="/A239047/b239047.txt">Table of n, a(n) for n = 1..180</a>
%F Empirical for column k:
%F k=1: a(n) = 2*a(n-1) +2*a(n-3)
%F k=2: [order 16]
%F k=3: [order 64]
%e Some solutions for n=3 k=4
%e ..2..2..2..0....0..0..0..2....2..2..0..3....0..0..3..2....0..3..3..0
%e ..0..0..0..0....0..2..2..2....2..0..0..2....0..3..1..0....0..3..1..0
%e ..0..0..0..0....2..0..0..0....2..1..3..1....2..1..3..0....0..2..2..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Mar 09 2014
| 