A298585 Number of nX4 0..1 arrays with every element equal to 0, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.

1, 2, 5, 4, 13, 31, 83, 262, 819, 2690, 8887, 29665, 99320, 333338, 1119938, 3764541, 12659539, 42574893, 143200453, 481671189, 1620186045, 5449885061, 18332044657, 61664686672, 207425872879, 697733534147, 2347018911372, 7894845781765

Offset

1,2

Comments

Column 4 of A298589.

Links

R. H. Hardin, Table of n, a(n) for n = 1..210

Formula

Empirical: a(n) = 2*a(n-1) +7*a(n-2) +5*a(n-3) -35*a(n-4) -43*a(n-5) -2*a(n-6) +110*a(n-7) +102*a(n-8) +114*a(n-9) -67*a(n-10) -202*a(n-11) -325*a(n-12) -89*a(n-13) +61*a(n-14) +109*a(n-15) +328*a(n-16) +163*a(n-17) +194*a(n-18) -164*a(n-19) -33*a(n-20) -176*a(n-21) -212*a(n-22) +41*a(n-23) +14*a(n-24) +15*a(n-25) +62*a(n-26) +41*a(n-27) -27*a(n-28) +13*a(n-29) +11*a(n-30) -14*a(n-31) +2*a(n-32) -a(n-33) -3*a(n-34)

Example

Some solutions for n=5
..0..0..0..0. .0..0..1..1. .0..0..1..1. .0..0..1..1. .0..0..0..0
..0..0..0..0. .0..0..1..1. .0..0..1..1. .0..0..1..1. .0..0..0..0
..0..1..0..0. .0..0..1..1. .0..0..1..1. .0..0..1..0. .0..0..1..0
..0..0..0..0. .0..0..1..1. .1..1..0..0. .0..0..1..1. .0..0..0..0
..0..0..0..0. .0..0..1..1. .1..1..0..0. .0..0..1..1. .0..0..0..0

Crossrefs

Cf. A298589.

Sequence in context: A264071 A212188 A331213 * A102468 A252668 A225046

Adjacent sequences: A298582 A298583 A298584 * A298586 A298587 A298588

Keyword

nonn

Author

R. H. Hardin, Jan 22 2018

Status

approved