login
T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock summing to a prime
6

%I #4 Dec 05 2014 18:22:26

%S 826,14008,14008,237566,583034,237566,4031056,24317054,24317054,

%T 4031056,68377410,1016045742,2500893370,1016045742,68377410,

%U 1160228856,42444702494,258178221074,258178221074,42444702494,1160228856

%N T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock summing to a prime

%C Table starts

%C ......826.......14008.........237566...........4031056.............68377410

%C ....14008......583034.......24317054........1016045742..........42444702494

%C ...237566....24317054.....2500893370......258178221074.......26647436069688

%C ..4031056..1016045742...258178221074....66013702120168....16881361773387422

%C .68377410.42444702494.26647436069688.16881361773387422.10697442429286457200

%H R. H. Hardin, <a href="/A251616/b251616.txt">Table of n, a(n) for n = 1..60</a>

%F Empirical for column k:

%F k=1: [linear recurrence of order 10]

%F k=2: [order 49]

%e Some solutions for n=1 k=4

%e ..0..0..3..4..2....0..0..5..6..5....0..0..3..5..5....0..0..1..5..4

%e ..0..3..5..1..0....1..6..0..2..4....0..3..5..6..1....5..0..2..3..1

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Dec 05 2014