|
%I #4 Jul 14 2018 15:09:25
%S 1,2,2,4,8,4,8,32,32,8,16,128,227,128,16,32,512,1603,1603,512,32,64,
%T 2048,11339,19816,11339,2048,64,128,8192,80196,246196,246196,80196,
%U 8192,128,256,32768,567185,3056047,5391628,3056047,567185,32768,256,512,131072
%N T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.
%C Table starts
%C ...1......2........4..........8............16..............32................64
%C ...2......8.......32........128...........512............2048..............8192
%C ...4.....32......227.......1603.........11339...........80196............567185
%C ...8....128.....1603......19816........246196.........3056047..........37935501
%C ..16....512....11339.....246196.......5391628.......117897523........2578023456
%C ..32...2048....80196....3056047.....117897523......4537910922......174669587289
%C ..64...8192...567185...37935501....2578023456....174669587289....11834952392431
%C .128..32768..4011528..470942175...56382210217...6724877943937...802147875327622
%C .256.131072.28372197.5846244187.1233022160942.258886627124646.54360782611063950
%H R. H. Hardin, <a href="/A316815/b316815.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)
%F k=2: a(n) = 4*a(n-1)
%F k=3: a(n) = 6*a(n-1) +10*a(n-2) -7*a(n-3) -64*a(n-4) -51*a(n-5) for n>6
%F k=4: [order 17] for n>18
%F k=5: [order 62] for n>63
%e Some solutions for n=5 k=4
%e ..0..0..0..1. .0..0..1..1. .0..0..0..1. .0..0..0..0. .0..0..0..1
%e ..1..1..1..0. .0..1..0..1. .1..1..1..1. .0..1..1..0. .0..1..0..1
%e ..1..0..0..1. .1..1..1..1. .0..1..0..1. .1..0..1..1. .0..0..1..1
%e ..0..0..1..1. .1..1..1..1. .1..0..0..0. .1..0..0..0. .0..0..0..0
%e ..1..1..1..1. .1..1..1..1. .1..1..1..0. .1..1..0..0. .0..1..1..0
%Y Column 1 is A000079(n-1).
%Y Column 2 is A004171(n-1).
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_, Jul 14 2018
| 