A303798 Number of nX6 0..1 arrays with every element unequal to 0, 1, 2 or 4 king-move adjacent elements, with upper left element zero.

32, 184, 121, 631, 1406, 5282, 11733, 41444, 108170, 344248, 929630, 2892458, 8095367, 24400687, 69641675, 207693852, 598414329, 1769154199, 5132971975, 15109509950, 43979589794, 129115991690, 376659787983, 1104126268562

Offset

1,1

Comments

Column 6 of A303800.

Links

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

Formula

Empirical: a(n) = a(n-1) +3*a(n-2) +7*a(n-3) +34*a(n-4) -41*a(n-5) -73*a(n-6) -197*a(n-7) -358*a(n-8) +403*a(n-9) +377*a(n-10) +1249*a(n-11) +1586*a(n-12) -1602*a(n-13) +966*a(n-14) -2538*a(n-15) -3797*a(n-16) +3189*a(n-17) -7038*a(n-18) +2194*a(n-19) +2068*a(n-20) -2509*a(n-21) +12300*a(n-22) -5636*a(n-23) +6082*a(n-24) -3835*a(n-25) -7445*a(n-26) +5400*a(n-27) -22987*a(n-28) +14307*a(n-29) -1635*a(n-30) +2786*a(n-31) +40645*a(n-32) -6184*a(n-33) +17146*a(n-34) +16716*a(n-35) -24292*a(n-36) -591*a(n-37) -15281*a(n-38) -26935*a(n-39) +1337*a(n-40) -18295*a(n-41) -9270*a(n-42) +4766*a(n-43) -3014*a(n-44) +1910*a(n-45) +7681*a(n-46) -7462*a(n-47) -2677*a(n-48) +6317*a(n-49) -2079*a(n-50) +3958*a(n-51) +14418*a(n-52) +2663*a(n-53) +5707*a(n-54) +3097*a(n-55) -1596*a(n-56) +3161*a(n-57) -6253*a(n-58) -2609*a(n-59) -746*a(n-60) -2446*a(n-61) -822*a(n-62) +630*a(n-63) +430*a(n-64) -82*a(n-65) +524*a(n-66) -120*a(n-67) -136*a(n-68) +112*a(n-69) -28*a(n-70) +16*a(n-71) for n>75

Example

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

Crossrefs

Cf. A303800.

Sequence in context: A029534 A120046 A370649 * A305243 A304477 A316302

Adjacent sequences: A303795 A303796 A303797 * A303799 A303800 A303801

Keyword

nonn

Author

R. H. Hardin, Apr 30 2018

Status

approved