editing

approved

R. H. Hardin, <a href="/A298143/b298143.txt">Table of n, a(n) for n = 1..210</a>

allocated for R. H. Hardin

Number of nX5 0..1 arrays with every element equal to 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.

0, 8, 1, 13, 34, 57, 73, 174, 350, 800, 1605, 3376, 7079, 15234, 32785, 69934, 148910, 317566, 680619, 1456297, 3114591, 6655750, 14238344, 30459198, 65161385, 139374566, 298140140, 637775747, 1364330204, 2918587246, 6243529255

1,2

Column 5 of A298146.

Empirical: a(n) = 2*a(n-1) +a(n-2) -a(n-3) +6*a(n-4) -9*a(n-5) -15*a(n-6) +a(n-7) -11*a(n-8) +12*a(n-9) +38*a(n-10) +43*a(n-11) +14*a(n-12) -38*a(n-13) -61*a(n-14) -5*a(n-15) -3*a(n-17) +17*a(n-18) +19*a(n-19) -38*a(n-20) -62*a(n-21) +16*a(n-22) +37*a(n-23) -7*a(n-24) -a(n-25) +50*a(n-26) +35*a(n-27) +2*a(n-28) -15*a(n-29) -2*a(n-30) -3*a(n-32) -2*a(n-33) -2*a(n-34) for n>40

Some solutions for n=7

..0..0..0..0..0. .0..0..0..0..0. .0..0..1..0..0. .0..0..1..0..0

..0..1..1..1..0. .0..1..1..1..0. .0..1..0..1..0. .0..1..0..1..0

..1..0..0..0..1. .1..0..1..0..1. .0..1..0..1..0. .0..1..1..1..0

..0..1..1..1..0. .1..0..0..0..1. .0..1..0..1..0. .0..1..0..1..0

..1..0..0..0..1. .1..0..1..0..1. .0..1..0..1..0. .0..0..0..1..0

..1..1..0..1..1. .0..1..1..1..0. .1..0..0..1..0. .0..1..0..1..0

..1..0..0..0..1. .0..0..0..0..0. .1..1..1..0..0. .1..1..1..0..0

Cf. A298146.

allocated

nonn

R. H. Hardin, Jan 13 2018

approved

editing

allocated for R. H. Hardin

allocated

approved