|
%I #6 Sep 03 2022 22:55:18
%S 458,5896,5896,75962,167554,75962,979132,4789458,4789458,979132,
%T 12620130,137223466,305835002,137223466,12620130,162672044,3932396176,
%U 19627202794,19627202794,3932396176,162672044,2096768998,112715450380,1260430729632
%N T(n,k) = Number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock summing to a prime.
%C Table starts
%C .......458.........5896..........75962............979132.............12620130
%C ......5896.......167554........4789458.........137223466...........3932396176
%C .....75962......4789458......305835002.......19627202794........1260430729632
%C ....979132....137223466....19627202794.....2830218950082......408635929747162
%C ..12620130...3932396176..1260430729632...408635929747162...132738273844782290
%C .162672044.112715450380.80982143877530.59049118022243816.43169937494954605912
%H R. H. Hardin, <a href="/A251474/b251474.txt">Table of n, a(n) for n = 1..84</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 10].
%F k=2: [order 45].
%e Some solutions for n=2, k=4
%e ..0..3..3..0..0....0..0..0..0..3....0..3..0..0..3....0..0..3..0..3
%e ..0..2..5..3..2....0..2..3..0..4....0..0..2..0..2....3..2..0..0..0
%e ..3..2..4..5..1....0..1..5..3..4....3..2..3..2..3....0..0..3..4..3
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 02 2014
| 